IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v5y2001i2d10.1023_a1011425821069.html
   My bibliography  Save this article

Finding a Noncrossing Steiner Forest in Plane Graphs Under a 2-Face Condition

Author

Listed:
  • Yoshiyuki Kusakari

    (Akita Prefectural University)

  • Daisuke Masubuchi

    (IBM Japan Ltd.)

  • Takao Nishizeki

    (Tohoku University)

Abstract

Let G = (V,E) be a plane graph with nonnegative edge weights, and let $$\mathcal{N}$$ be a family of k vertex sets $$N_1 ,N_2 ,...,N_k \subseteq V$$ , called nets. Then a noncrossing Steiner forest for $$\mathcal{N}$$ in G is a set $$\mathcal{T}$$ of k trees $$T_1 ,T_2 ,...,T_k$$ in G such that each tree $$T_i \in \mathcal{T}$$ connects all vertices, called terminals, in net N i, any two trees in $$\mathcal{T}$$ do not cross each other, and the sum of edge weights of all trees is minimum. In this paper we give an algorithm to find a noncrossing Steiner forest in a plane graph G for the case where all terminals in nets lie on any two of the face boundaries of G. The algorithm takes time $$O\left( {n\log n} \right)$$ if G has n vertices and each net contains a bounded number of terminals.

Suggested Citation

  • Yoshiyuki Kusakari & Daisuke Masubuchi & Takao Nishizeki, 2001. "Finding a Noncrossing Steiner Forest in Plane Graphs Under a 2-Face Condition," Journal of Combinatorial Optimization, Springer, vol. 5(2), pages 249-266, June.
    • Handle: RePEc:spr:jcomop:v:5:y:2001:i:2:d:10.1023_a:1011425821069
    DOI: 10.1023/A:1011425821069
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1011425821069
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1011425821069?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ranel E. Erickson & Clyde L. Monma & Arthur F. Veinott, 1987. "Send-and-Split Method for Minimum-Concave-Cost Network Flows," Mathematics of Operations Research, INFORMS, vol. 12(4), pages 634-664, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Shiono, Naoshi & Suzuki, Hisatoshi & Saruwatari, Yasufumi, 2019. "A dynamic programming approach for the pipe network layout problem," European Journal of Operational Research, Elsevier, vol. 277(1), pages 52-61.
    2. M. Didi Biha & A.R. Mahjoub, 2000. "Steiner k-Edge Connected Subgraph Polyhedra," Journal of Combinatorial Optimization, Springer, vol. 4(1), pages 131-144, March.
    3. Fontes, Dalila B.M.M. & Hadjiconstantinou, Eleni & Christofides, Nicos, 2006. "A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1205-1219, October.
    4. B. Curtis Eaves & Arthur F. Veinott, 2014. "Maximum-Stopping-Value Policies in Finite Markov Population Decision Chains," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 597-606, August.
    5. Lai, Minghui & Cai, Xiaoqiang & Li, Xiang, 2017. "Mechanism design for collaborative production-distribution planning with shipment consolidation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 137-159.
    6. Park, Koohyun & Shin, Yong-Sik, 2003. "Uncapacitated point-to-multipoint network flow problem and its application to multicasting in telecommunication networks," European Journal of Operational Research, Elsevier, vol. 147(2), pages 405-417, June.
    7. Dorit Hochbaum, 2007. "Complexity and algorithms for nonlinear optimization problems," Annals of Operations Research, Springer, vol. 153(1), pages 257-296, September.
    8. Martin Bichler & Zhen Hao & Richard Littmann & Stefan Waldherr, 2020. "Strategyproof auction mechanisms for network procurement," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(4), pages 965-994, December.

    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:jcomop:v:5:y:2001:i:2:d:10.1023_a:1011425821069. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.