Author of the publication

Approximating the Max Edge-Coloring Problem.

, , , and . IWOCA, volume 5874 of Lecture Notes in Computer Science, page 83-94. Springer, (2009)

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

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)Differential Ratio Approximation., and . Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall/CRC, (2007)On an Approximation Measure Founded on the Links Between Optimization and Polynomial Approximation Theory., and . Theor. Comput. Sci., 158 (1&2): 117-141 (1996)Efficient approximation of min set cover by moderately exponential algorithms., , and . Theor. Comput. Sci., 410 (21-23): 2184-2195 (2009)Local approximations for maximum partial subgraph problem., , and . Oper. Res. Lett., 32 (3): 217-224 (2004)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)Approximation of min coloring by moderately exponential algorithms., , and . Inf. Process. Lett., 109 (16): 950-954 (2009)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)