Author
Listed:
- Mitre Dourado
- Rodolfo Oliveira
- Fábio Protti
Abstract
For a set $$W$$ W of vertices of a connected graph $$G=(V(G),E(G))$$ G = ( V ( G ) , E ( G ) ) , a Steiner W-tree is a connected subgraph $$T$$ T of $$G$$ G such that $$W\subseteq V(T)$$ W ⊆ V ( T ) and $$|E(T)|$$ | E ( T ) | is minimum. Vertices in $$W$$ W are called terminals. In this work, we design an algorithm for the enumeration of all Steiner $$W$$ W -trees for a constant number of terminals, which is the usual scenario in many applications. We discuss algorithmic issues involving space requirements to compactly represent the optimal solutions and the time delay to generate them. After generating the first Steiner $$W$$ W -tree in polynomial time, our algorithm enumerates the remaining trees with $$O(n)$$ O ( n ) delay (where $$n=|V(G)|$$ n = | V ( G ) | ). An algorithm to enumerate all Steiner trees was already known (Khachiyan et al., SIAM J Discret Math 19:966–984, 2005 ), but this is the first one achieving polynomial delay. A by-product of our algorithm is a representation of all (possibly exponentially many) optimal solutions using polynomially bounded space. We also deal with the following problem: given $$W$$ W and a vertex $$x\in V(G)\setminus W$$ x ∈ V ( G ) \ W , is $$x$$ x in a Steiner $$W'$$ W ′ -tree for some $$\emptyset \ne W' \subseteq W$$ ∅ ≠ W ′ ⊆ W ? This problem is investigated from the complexity point of view. We prove that it is NP-hard when $$W$$ W has arbitrary size. In addition, we prove that deciding whether $$x$$ x is in some Steiner $$W$$ W -tree is NP-hard as well. We discuss how these problems can be used to define a notion of Steiner convexity in graphs. Copyright Springer Science+Business Media New York 2014
Suggested Citation
Mitre Dourado & Rodolfo Oliveira & Fábio Protti, 2014.
"Algorithmic aspects of Steiner convexity and enumeration of Steiner trees,"
Annals of Operations Research, Springer, vol. 223(1), pages 155-171, December.
Handle:
RePEc:spr:annopr:v:223:y:2014:i:1:p:155-171:10.1007/s10479-014-1607-5
DOI: 10.1007/s10479-014-1607-5
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:223:y:2014:i:1:p:155-171:10.1007/s10479-014-1607-5. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.