Approximation and hardness results for label cut and related problems
Author
Abstract
Suggested Citation
DOI: 10.1007/s10878-009-9222-0
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Refael Hassin & Jérôme Monnot & Danny Segev, 2007. "Approximation algorithms and hardness results for labeled connectivity problems," Journal of Combinatorial Optimization, Springer, vol. 14(4), pages 437-453, November.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Tlilane, Lydia, 2014. "Les matroïdes et leur implication dans l'allocation de ressources indivisibles : algorithmes d'approximation avec garantie de performance," Economics Thesis from University Paris Dauphine, Paris Dauphine University, number 123456789/14807 edited by Monnot, Jérôme.
- Xianmin Liu & Jianzhong Li, 2015. "Algorithms and complexity results for labeled correlation clustering problem," Journal of Combinatorial Optimization, Springer, vol. 29(2), pages 488-501, February.
- Zishen Yang & Wei Wang & Majun Shi, 2021. "Algorithms and Complexity for a Class of Combinatorial Optimization Problems with Labelling," Journal of Optimization Theory and Applications, Springer, vol. 188(3), pages 673-695, March.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Mehdy Roayaei & Mohammadreza Razzazi, 2017. "Augmenting weighted graphs to establish directed point-to-point connectivity," Journal of Combinatorial Optimization, Springer, vol. 33(3), pages 1030-1056, April.
- Xianmin Liu & Jianzhong Li, 2015. "Algorithms and complexity results for labeled correlation clustering problem," Journal of Combinatorial Optimization, Springer, vol. 29(2), pages 488-501, February.
More about this item
Keywords
Label cut; Approximation algorithms; Approximation hardness; Combinatorial optimization;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:21:y:2011:i:2:d:10.1007_s10878-009-9222-0. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.