Random Sampling in Cut, Flow, and Network Design Problems
From MaRDI portal
Publication:2757600
DOI10.1287/moor.24.2.383zbMath0977.90074OpenAlexW2150516767MaRDI QIDQ2757600
Publication date: 26 November 2001
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.2225
Programming involving graphs or networks (90C35) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Related Items (20)
Unnamed Item ⋮ Unit Capacity Maxflow in Almost $m^{4/3}$ Time ⋮ Unnamed Item ⋮ Sparse reliable graph backbones ⋮ Faster cut sparsification of weighted graphs ⋮ Models and methods for solving the problem of network vulnerability ⋮ Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection ⋮ Ranking and Sparsifying a Connection Graph ⋮ On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem ⋮ Unnamed Item ⋮ Approximating the smallest k -edge connected spanning subgraph by LP-rounding ⋮ Hallucination Helps: Energy Efficient Virtual Circuit Routing ⋮ Fixed parameter approximation scheme for min-max \(k\)-cut ⋮ A framework for clustering massive graph streams ⋮ Routing in Undirected Graphs with Constant Congestion ⋮ 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 ⋮ Unnamed Item ⋮ Guided design search in the interval-bounded sailor assignment problem
This page was built for publication: Random Sampling in Cut, Flow, and Network Design Problems
