Algorithms with large domination ratio

Journal of Algorithms

Volumn 50, Issue 1, 2004, Pages 118-131

  Alon, Noga ^a,b   Gutin, Gregory ^c   Krivelevich, Michael ^b  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Approximation algorithms; Combinatorial optimization; Domination analysis

Indexed keywords

COMBINATORIAL MATHEMATICS; HARMONIC ANALYSIS; MAXIMUM PRINCIPLE; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBABILITY; PROBLEM SOLVING; TIME SERIES ANALYSIS;

APPROXIMATION ALGORITHM; COMBINATORIAL OPTIMIZATION; LARGE DOMINATION RATIO; POLYNOMIAL TIME ALGORITHM;

ALGORITHMS;

EID: 0346640462     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2003.09.003     Document Type: Article

References (24)

1. N. Alon, Bipartite subgraphs, Combinatorica 16 (1996) 301-311.
2. N. Alon, Voting paradoxes and digraphs realizations, Adv. in Appl. Math. 29 (2002) 126-135.
3. N. Alon, B. Bollobás, M. Krivelevich, B. Sudakov, Maximum cuts and judicious partitions in graphs without short cycles, J. Combin. Theory Ser. B 88 (2003) 329-346.
4. N. Alon, J. H. Spencer, The Probabilistic Method, 2nd Edition, Wiley, New York, 2000.
5. D. Ben-Arieh, G. Gutin, M. Penn, A. Yeo, A. Zverovitch, Transformations of generalized ATSP into ATSP: experimental and theoretical study, Oper. Res. Lett. 41 (2003) 2581-2596.
6. D. Berend, S.S. Skiena, Combinatorial dominance guarantees for heuristic algorithms, Manuscript, 2002.
7. p product spaces, in: Séminaire d'analyse fonctionnelle, École Polytechnique, Centre de Mathématiques, 1979-80, pp. 41-49.
8. C.S. Edwards, Some extremal properties of bipartite subgraphs, Canad. J. Math. 3 (1973) 475-485.
9. C.S. Edwards, An improved lower bound for the number of edges in a largest bipartite subgraph, in: Proc. 2nd Czechoslovak Symposium on Graph Theory, Prague, 1975, pp. 167-181.
10. P. Erdös, On a lemma of Littlewood and Offord, Bull. Amer. Math. Soc. 51 (1945) 898-902.
11. E. Friedgut, V. Rödl, Proof of a hypercontractive estimate via entropy, Israel J. Math. 125 (2001) 369-380.
12. G. Grimmett, C. McDiarmid, On colouring random graphs, Math. Proc. Cambridge Philos. Soc. 77 (1975) 313-324.
13. G. Gutin, A. Vainshtein, A. Yeo, Domination analysis of combinatorial optimization problems, Discrete Appl. Math. 29 (2003) 513-520.
14. G. Gutin, A. Yeo, Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number, Discrete Appl. Math. 119 (2002) 107-116.
15. G. Gutin, A. Yeo, Anti-matroids, Oper. Res. Lett. 30 (2002) 97-99.
16. G. Gutin, A. Yeo, Z. Zverovitch, Exponential neighborhoods and domination analysis for the TSP, in: G. Gutin, A.P. Punnen (Eds.), The Traveling Salesman Problem and Its Variations, Kluwer, Dordrecht, 2002.
17. D.S. Johnson, G. Gutin, L. McGeoch, A. Yeo, X. Zhang, A. Zverovitch, Experimental analysis of heuristics for ATSP, in: G. Gutin, A.P. Punnen (Eds.), The Traveling Salesman Problem and Its Variations, Kluwer, Dordrecht, 2002.
18. J. Håstad, S. Venkatesh, On the advantage over a random assignment, in: Annual ACM Symposium on Theory of Computing, 2002, pp. 43-52.
19. A.E. Koller, S.D. Noble, Domination analysis of greedy heuristics for the frequency assignment problem, Discrete Math., in press.
20. S. Poljak, V. Rödl, J. Spencer, Tournament ranking with expected profit in polynomial time, SIAM J. Discrete Math. 1 (1988) 372-376.
21. A.P. Punnen, F. Margot, S.N. Kabadi, TSP heuristics: domination analysis and complexity, Algorithmica 35 (2003) 111-127.
22. A.P. Punnen, S. Kabadi, Domination analysis of some heuristics for the asymmetric traveling salesman problem, Discrete Appl. Math. 119 (2002) 117-128.
23. E. Sperner, Ein Satz über Untermegen einer endlichen Menge, Math. Z. 27 (1928) 544-548.
24. M. Talagrand, On Russo's approximate 0-1-law, Ann. Prob. 22 (1994) 1376-1387.