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

ISSN： 0178-4617

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

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 Label Cover Problems

By Charikar Moses Hajiaghayi MohammadTaghi Karloff Howard

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

Springer Publishing Company

Access to resources Recommend Favorite

Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems

By Aissi Hassene

4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol. 4, Iss. 4, 2006-12 ,pp. : 347-350

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for Quickest Spanning Tree Problems

By Hassin Refael Levin Asaf

Algorithmica, Vol. 41, Iss. 1, 2004-10 ,pp. : 43-52

Springer Publishing Company

Access to resources Recommend Favorite

Improved Approximation Algorithms for the Average-Case Tree Searching Problem

By Cicalese Ferdinando Jacobs Tobias Laber Eduardo Molinaro Marco

Algorithmica, Vol. 68, Iss. 4, 2014-04 ,pp. : 1045-1074

Springer Publishing Company

Access to resources Recommend Favorite

Minmax p -Traveling Salesmen Location Problems on a Tree

By Averbakh I.

Annals of Operations Research, Vol. 110, Iss. 1-4, 2002-02 ,pp. : 55-68

Springer Publishing Company

Access to resources Recommend Favorite