Hypergraph connectivity augmentation in strongly polynomial time
From MaRDI portal
Cites work
- A (1.5+)-approximation algorithm for weighted connectivity augmentation
- A better-than-2 approximation for weighted tree augmentation
- A Fast Algorithm for Optimally Increasing the Edge Connectivity
- Augmenting edge connectivity via isolating cuts
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Augmenting Undirected Edge Connectivity in Õ(n2) Time
- Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree
- Breaching the 2-approximation barrier for the forest augmentation problem
- Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification
- Counting and enumerating optimum cut sets for hypergraph \(k\)-partitioning problems for fixed \(k\)
- Covering skew-supermodular functions by hypergraphs of minimum total size
- Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed k
- Edge connectivity augmentation in near-linear time
- Edge-connectivity augmentation problems
- Efficient edge splitting-off algorithms maintaining all-pairs edge-connectivities
- Efficient splitting off algorithms for graphs
- High-Quality Hypergraph Partitioning
- scientific article; zbMATH DE number 5764893 (Why is no real title available?)
- Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
- Hypergraph \(k\)-cut in randomized polynomial time
- Hypergraph computation
- Hypergraph connectivity augmentation
- Hypergraph Cuts with General Splitting Functions
- Improved list-decodability and list-recoverability of Reed-Solomon codes via tree packings (extended abstract)
- Local edge-connectivity augmentation in hypergraphs is NP-complete
- Local search for weighted tree augmentation and Steiner tree
- Min-max partitioning of hypergraphs and symmetric submodular functions
- Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
- Minimum cuts and sparsification in hypergraphs
- NA-EDGE-CONNECTIVITY AUGMENTATION PROBLEMS BY ADDING EDGES(<Special Issue>Network Design, Control and Optimization)
- Near-linear size hypergraph cut sparsifiers
- New notions and constructions of sparsification for graphs and hypergraphs
- Parallel and fast sequential algorithms for undirected edge connectivity augmentation
- Posimodular function optimization
- Random contractions and sampling for hypergraph and hedge connectivity
- Sketching cuts in graphs and hypergraphs
- Spectral hypergraph sparsification via chaining
- Spectral hypergraph sparsifiers of nearly linear size
- Spectral sparsification of hypergraphs
- Steiner connectivity augmentation and splitting-off in poly-logarithmic maximum flows
- The minimum augmentation of any graph to aK-edge-connected graph
- Towards tight bounds for spectral sparsification of hypergraphs
This page was built for publication: Hypergraph connectivity augmentation in strongly polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253077)
