IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v188y2011i1p307-32910.1007-s10479-009-0533-4.html
   My bibliography  Save this article

Edge cover by connected bipartite subgraphs

Author

Listed:
  • Leo Liberti
  • Laurent Alfandari
  • Marie-Christine Plateau

Abstract

We consider the problem of covering the edge set of an unweighted, undirected graph with the minimum number of connected bipartite subgraphs (where the subgraphs are not necessarily bicliques). We show that this is an NP-hard problem, provide lower bounds through an integer programming formulation, propose several constructive heuristics and a local search, and discuss computational results. Finally, we consider a constrained variant of the problem which we show to be NP-hard, and provide an integer programming formulation for the variant. Copyright Springer Science+Business Media, LLC 2011

Suggested Citation

  • Leo Liberti & Laurent Alfandari & Marie-Christine Plateau, 2011. "Edge cover by connected bipartite subgraphs," Annals of Operations Research, Springer, vol. 188(1), pages 307-329, August.
    • Handle: RePEc:spr:annopr:v:188:y:2011:i:1:p:307-329:10.1007/s10479-009-0533-4
    DOI: 10.1007/s10479-009-0533-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-009-0533-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-009-0533-4?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.

    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:spr:annopr:v:188:y:2011:i:1:p:307-329:10.1007/s10479-009-0533-4. 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.