1554 search results - page 58 / 311 » Parameterized Complexity and Approximation Algorithms |
113
Voted
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
120
Voted
TON
2008
15 years 2 months ago
2008
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
105
Voted
SIGECOM
2006
ACM
15 years 8 months ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
110
Voted
SODA
2010
ACM
16 years 10 hour ago
2010
ACM
Spectral methods have been widely used in a broad range of application fields. One important object involved in such methods is the Laplace-Beltrami operator of a manifold. Indeed...
105
click to vote
ECCC
2008
15 years 2 months ago
2008
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...