A PTAS for the sparsest 2-spanner of 4-connected planar triangulations

Author： Duckworth W.   Wormald N.C.   Zito M.  

Publisher： Elsevier

ISSN： 1570-8667

Source： Journal of Discrete Algorithms, Vol.1, Iss.1, 2003-02, pp. : 67-76

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

Abstract

Related content

Planar Triangulations with Real Chromatic Roots Arbitrarily Close to 4

By Royle Gordon  

Annals of Combinatorics, Vol. 12, Iss. 2, 2008-07 ,pp. : 195-210

Springer Publishing Company

Access to resources Recommend Favorite

On the union of simply connected planar sets

By Karimov U.H.   Repovs D.  

Topology and its Applications, Vol. 122, Iss. 1, 2002-07 ,pp. : 281-286

Elsevier

Access to resources Recommend Favorite

A linear time algorithm to construct a tree 4-spanner on trapezoid graphs

By Barman Sambhu Charan  

International Journal of Computer Mathematics, Vol. 87, Iss. 4, 2010-03 ,pp. : 743-755

Taylor & Francis Ltd

Access to resources Recommend Favorite

Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations

By Goodrich M.T.   Tamassia R.  

Journal of Algorithms, Vol. 23, Iss. 1, 1997-04 ,pp. : 51-73

Academic Press

Access to resources Recommend Favorite

A PTAS for Semiconductor Burn-in Scheduling

By Deng Xiaotie   Feng Haodi   Li Guojun   Shi Benyun  

Journal of Combinatorial Optimization, Vol. 9, Iss. 1, 2005-02 ,pp. : 5-17

Springer Publishing Company

Access to resources Recommend Favorite