An improved approximation ratio for the minimum latency problem

Author： Goemans M.   Kleinberg J.  

Publisher： Elsevier

ISSN： 0025-5610

Source： Mathematical Programming, Vol.82, Iss.1, 1998-06, pp. : 111-124

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

A Better Approximation Ratio for the Minimum Size k-Edge-Connected Spanning Subgraph Problem

By Fernandes C.G.  

Journal of Algorithms, Vol. 28, Iss. 1, 1998-07 ,pp. : 105-124

Academic Press

Access to resources Recommend Favorite

Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem

By Gaur D.R.   Ibaraki T.   Krishnamurti R.  

Journal of Algorithms, Vol. 43, Iss. 1, 2002-04 ,pp. : 138-152

Academic Press

Access to resources Recommend Favorite

A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3

By Prömel H.J.   Steger A.  

Journal of Algorithms, Vol. 36, Iss. 1, 2000-07 ,pp. : 89-101

Academic Press

Access to resources Recommend Favorite

Hardness and approximation of minimum maximal matchings

By Demange Marc   Ekim Tınaz   Tanasescu Cerasela  

International Journal of Computer Mathematics, Vol. 91, Iss. 8, 2014-08 ,pp. : 1635-1654

Taylor & Francis Ltd

Access to resources Recommend Favorite

Quasistationary Approximation for the Stefan Problem

By Frolova E.  

Journal of Mathematical Sciences, Vol. 132, Iss. 4, 2006-01 ,pp. : 562-575

Springer Publishing Company

Access to resources Recommend Favorite