7930 search results - page 237 / 1586 » Greedy in Approximation Algorithms |
166
click to vote
AAIM
2008
Springer
16 years 27 days ago
2008
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of ...
165
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
170
click to vote
ATAL
2007
Springer
16 years 21 days ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
158
click to vote
ANOR
2005
15 years 6 months ago
2005
In the paper, two evolutionary approaches to the general DNA sequencing problem, assuming both negative and positive errors in the spectrum, are compared. The older of them is base...
162
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
We give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multiparameter problems. Specifically,...