12519 search results - page 177 / 2504 » Approximation Problems Categories |
183
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
153
click to vote
FOCS
2008
IEEE
16 years 27 days ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
199
click to vote
APPROX
2005
Springer
15 years 12 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
180
click to vote
CPM
2005
Springer
15 years 12 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
176
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
We present a series of results providing evidence that the incentive problem with VCG-based mechanisms is not very severe. Our first result uses average-case analysis to show that ...