Improved Approximation Algorithms for Uniform Connectivity Problems

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.21, Iss.2, 1996-09, pp. : 434-450

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

Improved Approximation Algorithms for MAX SAT

By Asano T. Williamson D.P.

Journal of Algorithms, Vol. 42, Iss. 1, 2002-01 ,pp. : 173-202

Elsevier

Access to resources Recommend Favorite

Improved approximation algorithms for metric MaxTSP

By Chen Zhi-Zhong Nagoya Takayuki

Journal of Combinatorial Optimization, Vol. 13, Iss. 4, 2007-05 ,pp. : 321-336

Springer Publishing Company

Access to resources Recommend Favorite

A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity

By Henzinger M.R.

Journal of Algorithms, Vol. 24, Iss. 1, 1997-07 ,pp. : 194-220

Academic Press

Access to resources Recommend Favorite

Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles

By Berman P. DasGupta B. Muthukrishnan S. Ramaswami S.

Journal of Algorithms, Vol. 41, Iss. 2, 2001-11 ,pp. : 443-470

Elsevier

Access to resources Recommend Favorite

Approximation Algorithms for Maximization Problems Arising in Graph Partitioning

By Feige U. Langberg M.

Journal of Algorithms, Vol. 41, Iss. 2, 2001-11 ,pp. : 174-211

Elsevier

Access to resources Recommend Favorite