Combined connectivity augmentation and orientation problems

András Frank, Tamás Király

Research output: Contribution to journalConference article

9 Citations (Scopus)

Abstract

Two important branches of graph connectivity problems are connectivity augmentation, which consists of augmenting a graph by adding new edges so as to meet a specified target connectivity, and connectivity orientation, where the goal is to find an orientation of an undirected or mixed graph that satisfies some specified edge-connection property. In the present work, an attempt is made to link the above two branches, by considering degree-specified and minimum cardinality augmentation of graphs so that the resulting graph admits an orientation satisfying a prescribed edge-connection requirement, such as (k,l)-edge-connectivity. The results are obtained by combining the supermodular polyhedral methods used in connectivity orientation with the splitting off operation, which is a standard tool in solving augmentation problems.

Original languageEnglish
Pages (from-to)401-419
Number of pages19
JournalDiscrete Applied Mathematics
Volume131
Issue number2
DOIs
Publication statusPublished - Sep 12 2003
EventSubmodularity - Atlanta, GA, United States
Duration: Aug 1 2000Aug 1 2000

    Fingerprint

Keywords

  • Connectivity augmentation
  • Graph orientation
  • Supermodularity

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this