Hedgegraph polymatroids
From MaRDI portal
Cites work
- A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem
- A tight quasi-polynomial bound for \textsc{Global Label Min-Cut}
- Approximation and hardness results for label cut and related problems
- Color fault-tolerant spanners
- Combinatorial optimization in networks with shared risk link groups
- Connections in combinatorial optimization
- Decomposition of Finite Graphs Into Forests
- Disjoint bases in a polymatroid
- Edge-Disjoint Spanning Trees of Finite Graphs
- Fixed-parameter tractability of hedge cut
- Flows and generalized coloring theorems in graphs
- scientific article; zbMATH DE number 3508211 (Why is no real title available?)
- scientific article; zbMATH DE number 3512137 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Hypergraph \(k\)-cut in randomized polynomial time
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
- Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
- Minimum partition of a matroid into independent subsets
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs
- On the orientation of graphs and hypergraphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Online disjoint spanning trees and polymatroid bases
- Quotient sparsification for submodular functions
- Random contractions and sampling for hypergraph and hedge connectivity
- Random sampling in cut, flow, and network design problems
- Splitting-off in hypergraphs
- The label cut problem with respect to path length and label frequency
- The parameterized complexity of some minimum label problems
This page was built for publication: Hedgegraph polymatroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349465)
