Complexity and approximation of the Constrained Forest problem期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

Complexity and approximation of the Constrained Forest problem

Authors:	Cristina Bazgan Basile CouëtouxZsolt Tuza

Affiliation:	^a Université Paris-Dauphine, LAMSADE, Place du Marechal de Lattre de Tassigny, 75775 Paris, Cedex 16, France ^b Computer and Automation Institute, Hungarian Academy of Sciences, H-1111 Budapest, Kende u. 13-17, Hungary ^c Department of Computer Science, University of Pannonia, H-8200 Veszprém, Egyetem u. 10, Hungary

Abstract:

Keywords:	Complexity Approximation APX-hardness Constrained Forest Ptas Bipartite graphs Planar graphs Treewidth
本文献已被 ScienceDirect 等数据库收录！