Inapproximability and approximability of maximal tree routing and coloring

Author： Chen Xujin Hu Xiaodong Shuai Tianping

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.11, Iss.2, 2006-03, pp. : 219-229

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 survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation

By Nguyen Trung Roos Magnus Rothe Jörg

Annals of Mathematics and Artificial Intelligence, Vol. 68, Iss. 1-3, 2013-07 ,pp. : 65-90

Springer Publishing Company

Access to resources Recommend Favorite

An Improved Approximation Algorithm for Multicast k-Tree Routing

By Lin Guohui

Journal of Combinatorial Optimization, Vol. 9, Iss. 4, 2005-06 ,pp. : 349-356

Springer Publishing Company

Access to resources Recommend Favorite

A decision tree cognitive routing scheme for cognitive radio mesh networks

WIRELESS COMMUNICATIONS & MOBILE COMPUTING (ELECTRONIC), Vol. 15, Iss. 10, 2015-07 ,pp. : 1405-1417

John Wiley & Sons Inc

Access to resources Recommend Favorite

On Approximability of Boolean Formula Minimization

By Prokopyev Oleg A. Pardalos Panos M.

Journal of Combinatorial Optimization, Vol. 8, Iss. 2, 2004-06 ,pp. : 129-135

Springer Publishing Company

Access to resources Recommend Favorite

Approximability of flow shop scheduling

By Hall L.A.

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 175-190

Elsevier

Access to resources Recommend Favorite