IEEE - Institute of Electrical and Electronics Engineers, Inc. - The Directed Steiner Network problem is tractable for a constant number of terminals

40th Annual Symposium on Foundations of Computer Science

Author(s): Feldman, J. ; Ruhl, M.
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 January 1999
Conference Location: New York City, NY, USA, USA
Conference Date: 17 October 1999
Page(s): 299 - 308
ISBN (Paper): 0-7695-0409-4
ISSN (Paper): 0272-5428
DOI: 10.1109/SFFCS.1999.814601
Regular:

We consider the Directed Steiner Network (DSN) problem, also called the Point-to-Point Connection problem, where given a directed graph G and p pairs {(s/sub 1/,t/sub 1/), ..., (s/sub p/,t/sub... View More

Advertisement