Improved Approximation Algorithms for Label Cover Problems

Author： Charikar Moses   Hajiaghayi MohammadTaghi   Karloff Howard  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.61, Iss.1, 2011-09, pp. : 190-206

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems

By Khani M.   Salavatipour Mohammad  

Algorithmica, Vol. 69, Iss. 2, 2014-06 ,pp. : 443-460

Springer Publishing Company

Access to resources Recommend Favorite

Improved Approximation Algorithms for Data Migration

By Khuller Samir   Kim Yoo-Ah   Malekian Azarakhsh  

Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. : 347-362

Springer Publishing Company

Access to resources Recommend Favorite

Bicriteria approximation algorithms for scheduling problems with communications delays

By Bampis Evripidis   Kononov Alexander  

Journal of Scheduling, Vol. 8, Iss. 4, 2005-07 ,pp. : 281-294

Springer Publishing Company

Access to resources Recommend Favorite

Outer approximation algorithms for canonical DC problems

By Bigi Giancarlo   Frangioni Antonio   Zhang Qinghua  

Journal of Global Optimization, Vol. 46, Iss. 2, 2010-02 ,pp. : 163-189

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for k-hurdle Problems

By Dean Brian   Griffis Adam   Parekh Ojas   Whitley Adam  

Algorithmica, Vol. 59, Iss. 1, 2011-01 ,pp. : 81-93

Springer Publishing Company

Access to resources Recommend Favorite