Approximation Schemes for Degree-Restricted MST and Red–Blue Separation Problems

ISSN： 0178-4617

Source： Algorithmica, Vol.40, Iss.3, 2004-08, pp. : 189-210

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

Polynomial-time approximation schemes for scheduling problems with time lags

By Zhang Xiandong Velde Steef

Journal of Scheduling, Vol. 13, Iss. 5, 2010-10 ,pp. : 553-559

Springer Publishing Company

Access to resources Recommend Favorite

Flexible approximation schemes with numerical and semi-analytical bases

By Dai Jianhua Pinheiro Helder Webb Jonathan P. Tsukerman Igor

COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol. 30, Iss. 2, 2011-03 ,pp. : 552-573

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Approximation schemes for the Min-Max Starting Time Problem

By Epstein Leah Tassa Tamir

Acta Informatica, Vol. 40, Iss. 9, 2004-09 ,pp. : 657-674

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for Bounded Degree Phylogenetic Roots

By Chen Zhi-Zhong

Algorithmica, Vol. 51, Iss. 1, 2008-05 ,pp. : 1-23

Springer Publishing Company

Access to resources Recommend Favorite

The perceived benefits of six-degree-separation social networks

By Shu Wesley Chuang Yu-Hao

Internet Research: Electronic Networking Applications and Policy, Vol. 21, Iss. 1, 2011-01 ,pp. : 26-45

Emerald Group Publishing Ltd

Access to resources Recommend Favorite