Domination analysis of combinatorial optimization problems

Authors:
Gregory Gutin;Alek Vainshtein;Anders Yeo
Affiliations:
Department of Computer Science, University of London, Royal Holloway, Egham, Surrey, TW20 0EX, UK;Department of Mathematics and Department of Computer Science, University of Haifa, Haifa, Israel;Department of Computer Science, University of London, Royal Holloway, Egham, Surrey, TW20 0EX, UK
Venue:
Discrete Applied Mathematics
Year:
2003

Citing 6
Cited 6

z-Approximations

Journal of Algorithms
Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number

Discrete Applied Mathematics
Domination analysis of some heuristics for the traveling salesman problem

Discrete Applied Mathematics
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
The Approximation of Maximum Subgraph Problems

ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Transformations of generalized ATSP into ATSP

Operations Research Letters

Algorithms with large domination ratio

Journal of Algorithms
Domination analysis for minimum multiprocessor scheduling

Discrete Applied Mathematics
Combinatorial dominance guarantees for problems with infeasible solutions

ACM Transactions on Algorithms (TALG)
Dominance guarantees for above-average solutions

Discrete Optimization
Greedy-type resistance of combinatorial problems

Discrete Optimization
Domination analysis of algorithms for bipartite boolean quadratic programs

FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.04

Visualization

Abstract

We use the notion of domination ratio introduced by Glover and Punnen in 1997 to present a new classification of combinatorial optimization (CO) problems: DOM-easy and DOM-hard problems. It follows from results already proved in the 1970s that min TSP (both symmetric and asymmetric versions) is DOM-easy. We prove that several CO problems are DOM-easy including weighted max k-SAT and max cut. We show that some other problems, such as max clique and min vertex cover, are DOM-hard unless P = NP.