Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm

Author： Catusse N.   Chepoi V.   Nouioua K.   Vaxès Y.  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.63, Iss.1-2, 2012-06, pp. : 551-567

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

An Approximation Algorithm for the Minimum Co-Path Set Problem

By Chen Zhi-Zhong   Lin Guohui   Wang Lusheng  

Algorithmica, Vol. 60, Iss. 4, 2011-08 ,pp. : 969-986

Springer Publishing Company

Access to resources Recommend Favorite

A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem

By Ahuja Ravindra K.   Hochbaum Dorit S.   Orlin James B.  

Algorithmica, Vol. 39, Iss. 3, 2004-04 ,pp. : 189-208

Springer Publishing Company

Access to resources Recommend Favorite

Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem

By Xiao Mingyu   Cai Leizhen   Yao Andrew  

Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. : 510-520

Springer Publishing Company

Access to resources Recommend Favorite

A fast distributed approximation algorithm for minimum spanning trees

By Khan Maleq   Pandurangan Gopal  

Distributed Computing, Vol. 20, Iss. 6, 2008-04 ,pp. : 391-402

Springer Publishing Company

Access to resources Recommend Favorite

New approximation algorithm for RTILE problem

By Lorys K.   Paluch K.E.  

Theoretical Computer Science, Vol. 303, Iss. 2, 2003-07 ,pp. : 517-537

Elsevier

Access to resources Recommend Favorite