676 search results - page 60 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
145
click to vote
CPM
2000
Springer
15 years 10 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
152
click to vote
AAAI
2007
15 years 8 months ago
2007
We present a new estimator for counting the number of solutions of a Boolean satisfiability problem as a part of an importance sampling framework. The estimator uses the recently...
176
click to vote
ESA
2009
Springer
16 years 22 days ago
2009
Springer
We study the performance of approximate Nash equilibria for congestion games with polynomial latency functions. We consider how much the price of anarchy worsens and how much the ...
175
click to vote
TAMC
2009
Springer
2009
Springer
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
16 years 21 days ago
We consider the feedback vertex set and feedback arc set problems in bipartite tournaments. We improve on recent results by giving a 2-approximation algorithm for the feedback vert...
142
click to vote
AAAI
2010
15 years 7 months ago
2010
The Gibbard-Satterthwaite Theorem asserts that any reasonable voting rule cannot be strategyproof. A large body of research in AI deals with circumventing this theorem via computa...