A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.36, Iss.2, 2000-08, pp. : 182-204

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

A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem

By Hong S.-P. Chung S.-J. Park B.H.

Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. : 233-239

Elsevier

Access to resources Recommend Favorite

Makespan minimization in open shops: A polynomial time approximation scheme

By Sevastianov S.V. J. Woeginger G.

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 191-198

Elsevier

Access to resources Recommend Favorite

Approximating Maximum Leaf Spanning Trees in Almost Linear Time

By Lu H-I. Ravi R.

Journal of Algorithms, Vol. 29, Iss. 1, 1998-10 ,pp. : 132-141

Academic Press

Access to resources Recommend Favorite

Degree Bounded Spanning Trees

By Fujisawa Jun

Graphs and Combinatorics, Vol. 26, Iss. 5, 2010-09 ,pp. : 695-720

Springer Publishing Company

Access to resources Recommend Favorite

Polynomial time approximation schemes for minimum disk cover problems

By Liao Chen Hu Shiyan

Journal of Combinatorial Optimization, Vol. 20, Iss. 4, 2010-11 ,pp. : 399-412

Springer Publishing Company

Access to resources Recommend Favorite