Skip to main content
SpringerLink
Log in

Covering symmetric supermodular functions by graphs

  • Published:
Mathematical Programming Submit manuscript

Abstract

The minimum number of edges of an undirected graph covering a symmetric, supermodular set-function is determined. As a special case, we derive an extension of a theorem of J. Bang-Jensen and B. Jackson on hypergraph connectivity augmentation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Computer and Automation Institute, Hungarian Academy of Sciences, and Department of Operations Research, Eötvös University, Budapest, e-mail: benczur@cs.elte.hu, HU

    András A. Benczúr

  2. Department of Operations Research, Eötvös University, Rákóczi út 5, Budapest, Hungary, H-1088 and Ericsson Traffic Laboratory, Laborc u.1. Budapest, Hungary, H-1037, e-mail: frank@cs.elte.hu, HU

    András Frank

Authors
  1. András A. Benczúr
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. András Frank
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received December 1996 / Revised version received January 1998 Published online March 16, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Benczúr, A., Frank, A. Covering symmetric supermodular functions by graphs. Math. Program. 84, 483–503 (1999). https://doi.org/10.1007/s101070050034

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s101070050034

Search

Navigation