IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-08623-6_24.html
   My bibliography  Save this book chapter

Finding Minimum Balanced Separators - An Exact Approach

In: Operations Research Proceedings 2021

Author

Listed:
  • William Surau

    (Zuse Institute Berlin)

  • Ralf Borndörfer

    (Zuse Institute Berlin)

  • Stephan Schwartz

    (Zuse Institute Berlin)

Abstract

Balanced separators are node sets that split the graph into size bounded components. They find applications in different theoretical and practical problems. In this paper we discuss how to find a minimum set of balanced separators in node weighted graphs. Our contribution is a new and exact algorithm that solves Minimum Balanced Separators by a sequence of Hitting Set problems. The only other exact method appears to be a mixed-integer program (MIP) for the edge weighted case. We adapt this model to node weighted graphs and compare it to our approach on a set of instances, resembling transit networks. It shows that our algorithm is far superior on almost all test instances.

Suggested Citation

  • William Surau & Ralf Borndörfer & Stephan Schwartz, 2022. "Finding Minimum Balanced Separators - An Exact Approach," Lecture Notes in Operations Research, in: Norbert Trautmann & Mario Gnägi (ed.), Operations Research Proceedings 2021, pages 154-159, Springer.
    • Handle: RePEc:spr:lnopch:978-3-031-08623-6_24
    DOI: 10.1007/978-3-031-08623-6_24
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Keywords

    Node separators; Integer programming;

    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:spr:lnopch:978-3-031-08623-6_24. 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.

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