Algorithms with large domination ratio, Journal of Algorithms, vol.50, issue.1, pp.118-131, 2004. ,
DOI : 10.1016/j.jalgor.2003.09.003
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, 1999. ,
DOI : 10.1007/978-3-642-58412-1
Free bits, PCPs and non-approximability-towards tight results, Proceedings of IEEE 36th Annual Foundations of Computer Science, pp.422-431, 1995. ,
DOI : 10.1109/SFCS.1995.492573
Combinatorial dominance guarantees for problems with infeasible solutions. submitted, 2006. ,
Dominance certificates for combinatorial optimization problems. submitted, 2006. ,
When the greedy algorithm fails, Discrete Optimization, vol.1, issue.2, pp.121-127, 2004. ,
Domination analysis for minimum multiprocessor scheduling, Discrete Applied Mathematics, vol.154, issue.18 ,
DOI : 10.1016/j.dam.2006.02.010
The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms, Journal of the Operational Research Society, vol.48, issue.5, pp.502-510, 1997. ,
DOI : 10.1057/palgrave.jors.2600392
Domination analysis of combinatorial optimization problems, Discrete Applied Mathematics, vol.129, issue.2-3, 2003. ,
DOI : 10.1016/S0166-218X(03)00359-7
Polynomial approximation algorithms for the TSP and the QAP with factorial domination number, Discrete Applied Mathematics, 2001. ,
TSP tour dimination and hamilton cycle decomposition of regular digraphs. Operation Research Letters, 2001. ,
The Traveling Salesman Problem and its Variations, pp.223-256, 2002. ,
DOI : 10.1007/b101971
z-Approximations, Journal of Algorithms, vol.41, issue.2, pp.429-442, 2001. ,
DOI : 10.1006/jagm.2001.1187
Estimates of the accuracy of procedures in the traveling salesman problem, Numerical Mathematics and Computer Technology, vol.4, pp.18-23, 1973. ,
The approximate solution of the traveling salesman problem by a local algorithm that searches neighborhoods of exponential cardinality in quadratic time, Software: Algorithms and Programs (in Russian), pp.8-11, 1981. ,
The approximate solution of the traveling salesman problem by a local algorithm that searches neighborhoods of factorial cardinality in cubic time, Software: Algorithms and Programs (in Russian), pp.11-13, 1981. ,
Measuring the quality of approximate solutions to zero-one programming problems, Mathematics of Operations Research, vol.6, pp.319-332, 1981. ,