Improved Approximation Bounds for Edge Dominating Set in Dense Graphs

Jean Cardinal, Stefan Langerman, Eythan Levy. Improved Approximation Bounds for Edge Dominating Set in Dense Graphs. In Thomas Erlebach, Christos Kaklamanis, editors, Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers. Volume 4368 of Lecture Notes in Computer Science, pages 108-120, Springer, 2006. [doi]

Authors

Jean Cardinal

This author has not been identified. Look up 'Jean Cardinal' in Google

Stefan Langerman

This author has not been identified. It may be one of the following persons: Look up 'Stefan Langerman' in Google

Eythan Levy

This author has not been identified. Look up 'Eythan Levy' in Google