840 search results - page 78 / 168 » Inapproximability of Combinatorial Optimization Problems |
105
Voted
SAC
2004
ACM
15 years 5 months ago
2004
ACM
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
143
click to vote
ICML
1995
IEEE
16 years 1 months ago
1995
IEEE
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
78
Voted
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
86
Voted
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
A long-standing conjecture in Combinatorial Optimization is that the integrality gap of the Held-Karp LP relaxation for the Asymmetric Traveling Salesman Problem (ATSP) is a consta...
109
click to vote
ICDAR
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper deals with performance evaluation of rasterto-vector conversion algorithms. We briefly review the past work, and focus our attention on a method proposed by Phillips a...