Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
From MaRDI portal
Publication:958684
DOI10.1016/j.jctb.2008.01.006zbMath1211.05092MaRDI QIDQ958684
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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