Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Efficient algorithms for the max k-vertex cover problem., and . J. Comb. Optim., 28 (3): 674-691 (2014)A survey on the structure of approximation classes., and . Computer Science Review, 4 (1): 19-40 (2010)On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems., , and . IEEE Trans. Computers, 40 (12): 1413-1418 (1991)Improved Approximations for Weighted and Unweighted Graph Problems., and . Theory Comput. Syst., 38 (6): 763-787 (2005)Jon Lee, A First Course in Combinatorial Optimization, Cambridge Texts in Applied Mathematics.. European Journal of Operational Research, 168 (3): 1042-1044 (2006)Differential approximation results for the traveling salesman problem with distances 1 and 2., , and . European Journal of Operational Research, 145 (3): 557-568 (2003)A simulated annealing approach for the circular cutting problem., , and . European Journal of Operational Research, 159 (2): 430-448 (2004)Approximation of min coloring by moderately exponential algorithms., , and . Inf. Process. Lett., 109 (16): 950-954 (2009)Greedy Algorithms For On-Line Set-Covering., , , and . Algorithmic Operations Research, 4 (1): 36-48 (2009)Approximating the metric 2-Peripatetic Salesman Problem., , and . Algorithmic Operations Research, 5 (1): 13-20 (2010)