Combined connectivity augmentation and orientation problems

DOI10.1016/S0166-218X(02)00460-2zbMath1030.90098MaRDI QIDQ1410691

András Frank, Tamás Király

Publication date: 14 October 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Connectivity augmentationSupermodularityGraph orientation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Connectivity (05C40)

Related Items (5)

Sparse Graphs and an Augmentation Problem ⋮ Approximating Minimum Cost Connectivity Orientation and Augmentation ⋮ A Survey on Covering Supermodular Functions ⋮ Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs ⋮ Sparse graphs and an augmentation problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge-connectivity augmentation problems
• On the orientation of graphs
• Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
• On the degrees of the vertices of a directed graph
• On the Problem of Decomposing a Graph into n Connected Factors
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Structures of polyhedra determined by submodular functions on crossing families
• Decomposition of Finite Graphs Into Forests
• Existence of k-edge connected ordinary graphs with prescribed degrees

This page was built for publication: Combined connectivity augmentation and orientation problems