Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs

DOI10.1016/j.jctb.2008.01.006zbMath1211.05092OpenAlexW2162517951MaRDI QIDQ958684

Lap Chi Lau, Tamás Király

Publication date: 8 December 2008

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2008.01.006

zbMATH Keywords

hypergraphorientationSteiner tree

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Graph orientations with set connectivity requirements ⋮ On orienting graphs for connectivity: Projective planes and Halin graphs ⋮ On Eulerian orientations of even-degree hypercubes ⋮ Decreasing minimization on M-convex sets: algorithms and applications

Cites Work

• On the orientation of graphs
• Edge-disjoint trees containing some given vertices in a graph
• On the orientation of graphs and hypergraphs
• Combined connectivity augmentation and orientation problems
• On the degrees of the vertices of a directed graph
• Algorithmic construction of sets for k -restrictions
• On the Problem of Decomposing a Graph into n Connected Factors
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• Packing Steiner Forests
• A Reduction Method for Edge-Connectivity in Graphs
• An Algorithm for Submodular Functions on Graphs
• Approximating theDomatic Number
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs