3341 search results - page 207 / 669 » On Bounded Queries and Approximation |
112
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
Many commonly-used auction mechanisms are "maximal-in-range". We show that any maximalin-range mechanism for n bidders and m items cannot both approximate the social wel...
181
click to vote
COCOON
2005
Springer
15 years 11 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
143
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
136
click to vote
TSP
2008
15 years 5 months ago
2008
We derive an easy-to-compute approximate bound for the range of step-sizes for which the constant-modulus algorithm (CMA) will remain stable if initialized close to a minimum of t...
146
click to vote
INFOCOM
2009
IEEE
16 years 14 days ago
2009
IEEE
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...