"The rectilinear Steiner arborescence problem is NP-complete."

Weiping Shi, Chen Su (2000)

Details and statistics

DOI:

access: closed

type: Conference or Workshop Paper

metadata version: 2012-12-07

a service of  Schloss Dagstuhl - Leibniz Center for Informatics