2957 search results - page 106 / 592 » The Complexity of Polynomial-Time Approximation |
125
Voted
STACS
2010
Springer
15 years 10 months ago
2010
Springer
We present two new approximation algorithms with (improved) constant ratios for selecting n points in n unit disks such that the minimum pairwise distance among the points is maxi...
125
click to vote
ESA
2005
Springer
15 years 8 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
115
click to vote
ESA
2003
Springer
15 years 8 months ago
2003
Springer
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
115
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of designing truthful auctions, when the bidders' valuations have a public and a private component. In particular, we consider combinatorial auctions w...
116
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...