Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems

ISSN： 0178-4617

Source： Algorithmica, Vol.62, Iss.3-4, 2012-04, pp. : 1198-1221

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

News from the online traveling repairman

By Krumke S.O. de Paepe W.E. Poensgen D. Stougie L.

Theoretical Computer Science, Vol. 295, Iss. 1, 2003-02 ,pp. : 279-294

Elsevier

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

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