Proceedings
2018 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing
New Approximation Algorithms for Minimum Weighted Edge Cover
Pages 97 - 108
Abstract
We describe two new 3/2-approximation algorithms and a new 2-approximation algorithm for the minimum weight edge cover problem in graphs. We show that one of the 3/2-approximation algorithms, the Dual cover algorithm, computes the lowest weight edge cover relative to previously known algorithms as well as the new algorithms reported here. The Dual cover algorithm can also be implemented to be faster than the other 3/2-approximation algorithms on serial computers. Many of these algorithms can be extended to solve the 6-Edge cover problem as well. We show the relation of these algorithms to the K-Nearest Neighbor graph construction in semi-supervised learning and other applications.
Formats available
You can view the full content in the following formats:
Information & Authors
Information
Published In
2018 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing
Pages: 97 - 108
Editors: Fredrik Manne, University of Bergen, Norway, Peter Sanders, Karlsruhe Institute of Technology, Germany, and Sivan Toledo, Tel-Aviv University, Israel
ISBN (Online): 978-1-61197-521-5
Copyright
© 2018 by the Society for Industrial and Applied Mathematics.
History
Published online: 7 August 2018
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Classes of linear programs solvable by coordinate-wise minimizationAnnals of Mathematics and Artificial Intelligence, Vol. 90, No. 7-9 | 14 April 2021
- EXAGRAPH: Graph and combinatorial methods for enabling exascale applicationsThe International Journal of High Performance Computing Applications, Vol. 35, No. 6 | 30 September 2021
- Approximation algorithm for the multicovering problemJournal of Combinatorial Optimization, Vol. 41, No. 2 | 9 January 2021
- Approximation algorithms in combinatorial scientific computingActa Numerica, Vol. 28 | 14 June 2019
- Adaptive Anonymization of Data using b-Edge CoverSC18: International Conference for High Performance Computing, Networking, Storage and Analysis | 1 Nov 2018
- Parallel Algorithms Through Approximation: B-Edge Cover2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) | 1 May 2018
View Options
View options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].