Author of the publication

Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs.

, , and . FCT, volume 4639 of Lecture Notes in Computer Science, page 52-63. Springer, (2007)

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

An experimental study of greedy routing algorithms., , , and . HPCS, page 150-156. IEEE, (2010)Energy-Efficient Communication in Multi-interface Wireless Networks., , , and . Theory Comput. Syst., 52 (2): 285-296 (2013)Energy-Efficient Communication in Multi-interface Wireless Networks., , , and . MFCS, volume 5734 of Lecture Notes in Computer Science, page 102-111. Springer, (2009)Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs., , and . FCT, volume 4639 of Lecture Notes in Computer Science, page 52-63. Springer, (2007)University students' intention to use search engines for research purposes: A structural equation modeling approach., , , , and . Educ. Inf. Technol., 25 (4): 2463-2479 (2020)Αποδοτικοί αλγόριθμοι για την κατανομή ενέργειας σε ασύρματα δίκτυα. University of Patras, Greece, (2009)National Archive of PhD Theses: oai:10442/27938.Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks., , , and . ADHOC-NOW, volume 3158 of Lecture Notes in Computer Science, page 183-196. Springer, (2004)An Improved Approximation Bound for Spanning Star Forest and Color Saving., , , and . MFCS, volume 5734 of Lecture Notes in Computer Science, page 90-101. Springer, (2009)Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs., , and . Theory Comput. Syst., 45 (3): 555-576 (2009)Examining Student Teachers' Perceptions and Attitudes towards Game Based Learning., , , and . FDG, page 109:1-109:5. ACM, (2020)