Random sampling in cut, flow, and network design problems
From MaRDI portal
Recommendations
Cited in
(37)- Random sampling and greedy sparsification for matroid optimization problems
- Models and methods for solving the problem of network vulnerability
- Guided design search in the interval-bounded sailor assignment problem
- Faster cut sparsification of weighted graphs
- Random sampling in cut, flow, and network design problems
- Routing in undirected graphs with constant congestion
- Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding
- Deterministic Sampling Algorithms for Network Design
- Sparse reliable graph backbones
- scientific article; zbMATH DE number 1241396 (Why is no real title available?)
- Random contractions and sampling for hypergraph and hedge connectivity
- scientific article; zbMATH DE number 1418277 (Why is no real title available?)
- A framework for clustering massive graph streams
- Ranking and sparsifying a connection graph
- Computing exact minimum cuts without knowing the graph
- Unit Capacity Maxflow in Almost $m^{4/3}$ Time
- Time-message trade-offs in distributed algorithms
- On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem
- Hallucination helps: energy efficient virtual circuit routing
- Graph reduction with spectral and cut guarantees
- A general framework for graph sparsification
- Randomized approximation schemes for cuts and flows in capacitated graphs
- Fast augmenting paths by random sampling from residual graphs
- Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection
- Deterministic sampling algorithms for network design
- STACS 2005
- scientific article; zbMATH DE number 7053293 (Why is no real title available?)
- Fixed parameter approximation scheme for min-max \(k\)-cut
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing
- Near-optimal distributed computation of small vertex cuts
- Minimum cut in \(O(m \log^2 n)\) time
- Minimum cut in O(m^2 n time
- On packing low-diameter spanning trees
- On the size of two minimal linkages
- Distributional limits of graph cuts on discretized grids
- Sublinear time hypergraph sparsification via cut and edge sampling queries
- Cut-preserving vertex sparsifiers for planar and quasi-bipartite graphs
This page was built for publication: Random sampling in cut, flow, and network design problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757600)
