Download:
by Daniel Berend, Steven S. Skiena
http://www.cs.sunysb.edu/~skiena/papers/dominate.pdf
Add To MetaCart
Abstract:
The design of approximation algorithms for NP-hard problems is perhaps the most active research area in the theory of combinatorial algorithms. However, provably good approximation algorithms often perform poorly in practice compared to local search heuristics without the theoretical pedigree.
Citations
|
195
|
Free bits, PCPs, and nonapproximability-- towards tight results
– Bellare, Goldreich, et al.
- 1998
|
|
140
|
Fast approximation algorithms for the knapsack and sum of subset problems
– Ibarra, Kim
- 1975
|
|
29
|
The travelling salesman problem: new solvable cases and linkages with the development of approximiation algorithms
– Glover, Punnen
- 1997
|
|
24
|
Linear time dynamic programming algorithms for some new classes of restricted TSP's
– Balas, Simonetti
- 1996
|
|
19
|
A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem
– Deineko, Woeginger
- 2000
|
|
15
|
Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
– Gutin, Yeo
|
|
14
|
Approximate solution of the traveling salesman problem by a local algorithm with scanning neighbourhoods of factorial cardinality in cubic time
– Sarvanov, Doroshko
- 1981
|
|
10
|
Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP
– Gutin, Yeo, et al.
|
|
3
|
Tsp heuristics: Domination analysis and complexity
– Punnen, Margot, et al.
- 2001
|
|
2
|
Polynominal restriction approach for the atsp and stsp
– Gutin, Yeo, et al.
|
|
1
|
TSP tour dimination and hamilton cycle decomposition of regular digraphs
– Gutin, Yeo
- 2001
|
|
1
|
A model for analyzing black-box optimization. submitted for publication
– Phan, Skiena, et al.
- 2002
|
