Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
From MaRDI portal
Publication:958684
DOI10.1016/J.JCTB.2008.01.006zbMATH Open1211.05092OpenAlexW2162517951MaRDI QIDQ958684FDOQ958684
Authors: Tamás Király, Lap Chi Lau 
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
Recommendations
Cites Work
- 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
- Edge-Disjoint Spanning Trees of Finite Graphs
- Title not available (Why is that?)
- Edge-disjoint trees containing some given vertices in a graph
- A Reduction Method for Edge-Connectivity in Graphs
- Approximating theDomatic Number
- Algorithmic construction of sets for k -restrictions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the orientation of graphs
- On the orientation of graphs and hypergraphs
- Title not available (Why is that?)
- An Algorithm for Submodular Functions on Graphs
- Packing Steiner Forests
- Combined connectivity augmentation and orientation problems
- Title not available (Why is that?)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Cited In (6)
- On orienting graphs for connectivity: Projective planes and Halin graphs
- Graph orientations with set connectivity requirements
- Steiner connectivity problems in hypergraphs
- On Eulerian orientations of even-degree hypercubes
- Rooted \(k\)-connections in digraphs
- Decreasing minimization on M-convex sets: algorithms and applications
This page was built for publication: Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q958684)
