IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v27y2014i1d10.1007_s10878-012-9565-9.html
   My bibliography  Save this article

On the generalized multiway cut in trees problem

Author

Listed:
  • Hong Liu

    (Shandong University)

  • Peng Zhang

    (Shandong University)

Abstract

Given a tree $$T = (V, E)$$ with $$n$$ vertices and a collection of terminal sets $$D = \{S_1, S_2, \ldots , S_c\}$$ , where each $$S_i$$ is a subset of $$V$$ and $$c$$ is a constant, the generalized multiway cut in trees problem (GMWC(T)) asks to find a minimum size edge subset $$E^{\prime } \subseteq E$$ such that its removal from the tree separates all terminals in $$S_i$$ from each other for each terminal set $$S_i$$ . The GMWC(T) problem is a natural generalization of the classical multiway cut in trees problem, and has an implicit relation to the Densest $$k$$ -Subgraph problem. In this paper, we show that the GMWC(T) problem is fixed-parameter tractable by giving an $$O(n^2 + 2^k)$$ time algorithm, where $$k$$ is the size of an optimal solution, and the GMWC(T) problem is polynomial time solvable when the problem is restricted in paths.We also discuss some heuristics for the GMWC(T) problem

Suggested Citation

  • Hong Liu & Peng Zhang, 2014. "On the generalized multiway cut in trees problem," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 65-77, January.
    • Handle: RePEc:spr:jcomop:v:27:y:2014:i:1:d:10.1007_s10878-012-9565-9
    DOI: 10.1007/s10878-012-9565-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-012-9565-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-012-9565-9?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. David R. Karger & Philip Klein & Cliff Stein & Mikkel Thorup & Neal E. Young, 2004. "Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut," Mathematics of Operations Research, INFORMS, vol. 29(3), pages 436-461, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Xiaofei Liu & Weidong Li, 2022. "Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1964-1976, October.
    2. Xiaofei Liu & Weidong Li, 0. "Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-13.

    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. Niv Buchbinder & Roy Schwartz & Baruch Weizman, 2021. "Simplex Transformations and the Multiway Cut Problem," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 757-771, May.
    2. Mark Velednitsky & Dorit S. Hochbaum, 0. "Isolation branching: a branch and bound algorithm for the k-terminal cut problem," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-21.
    3. Mark Velednitsky & Dorit S. Hochbaum, 2022. "Isolation branching: a branch and bound algorithm for the k-terminal cut problem," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1659-1679, October.
    4. Mark Velednitsky, 2022. "Solving $$(k-1)$$ ( k - 1 ) -stable instances of k-terminal cut with isolating cuts," Journal of Combinatorial Optimization, Springer, vol. 43(2), pages 297-311, March.

    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:27:y:2014:i:1:d:10.1007_s10878-012-9565-9. 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.