IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v186y2008i2p542-553.html
   My bibliography  Save this article

Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs

Author

Listed:
  • Guo, Jiong
  • Huffner, Falk
  • Kenar, Erhan
  • Niedermeier, Rolf
  • Uhlmann, Johannes

Abstract

No abstract is available for this item.

Suggested Citation

  • Guo, Jiong & Huffner, Falk & Kenar, Erhan & Niedermeier, Rolf & Uhlmann, Johannes, 2008. "Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs," European Journal of Operational Research, Elsevier, vol. 186(2), pages 542-553, April.
    • Handle: RePEc:eee:ejores:v:186:y:2008:i:2:p:542-553
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00222-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Costa, Marie-Christine & Letocart, Lucas & Roupin, Frederic, 2005. "Minimal multicut and maximal integer multiflow: A survey," European Journal of Operational Research, Elsevier, vol. 162(1), pages 55-69, April.
    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. Guan, Xiucui & Zhang, Jianzhong, 2007. "Improving multicut in directed trees by upgrading nodes," European Journal of Operational Research, Elsevier, vol. 183(3), pages 971-980, December.
    2. Bentz, Cédric & Costa, Marie-Christine & Létocart, Lucas & Roupin, Frédéric, 2009. "Multicuts and integral multiflows in rings," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1251-1254, August.
    3. Bocquillon, Ronan & Jouglet, Antoine & Carlier, Jacques, 2015. "The data transfer problem in a system of systems," European Journal of Operational Research, Elsevier, vol. 244(2), pages 392-403.
    4. Lihui Bai & Donald Hearn & Siriphong Lawphongpanich, 2010. "A heuristic method for the minimum toll booth problem," Journal of Global Optimization, Springer, vol. 48(4), pages 533-548, December.
    5. Bentz, Cédric & Cornaz, Denis & Ries, Bernard, 2013. "Packing and covering with linear programming: A survey," European Journal of Operational Research, Elsevier, vol. 227(3), pages 409-422.
    6. Walid Ben-Ameur & Mohamed Didi Biha, 2016. "Extended cuts," Journal of Combinatorial Optimization, Springer, vol. 31(3), pages 1034-1044, April.
    7. Akgün, Ibrahim & Tansel, Barbaros Ç. & Kevin Wood, R., 2011. "The multi-terminal maximum-flow network-interdiction problem," European Journal of Operational Research, Elsevier, vol. 211(2), pages 241-251, June.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:186:y:2008:i:2:p:542-553. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.