Approximation algorithms and hardness results for cycle packing problems

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Michael Krivelevich Tel Aviv University, Tel Aviv, Israel
Zeev Nutov Open University of Israel, Tel Aviv, Israel
Mohammad R. Salavatipour University of Alberta, Edmonton, Canada
Jacques Verstraete Yuster University of Waterloo, Canada
Raphael Yuster University of Haifa, Haifa, Israel
Approximation algorithms and hardness results for cycle packing problems Published by ACM 2007 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 43
· Downloads (cumulative): 393
· Citation Count: 12

Published in:
Cover Image
 
· Journal
ACM Transactions on Algorithms (TALG) TALG Homepage archive
Volume 3 Issue 4, November 2007
Article No. 48
ACM New York, NY, USA
table of contents doi>10.1145/1290672.1290685

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder