Pages that link to "Item:Q2757600"
From MaRDI portal
The following pages link to Random sampling in cut, flow, and network design problems (Q2757600):
Displaying 28 items.
- Sparse reliable graph backbones (Q418121) (← links)
- Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection (Q541996) (← links)
- Deterministic sampling algorithms for network design (Q547282) (← links)
- Random sampling and greedy sparsification for matroid optimization problems (Q1290633) (← links)
- Models and methods for solving the problem of network vulnerability (Q1951863) (← links)
- Guided design search in the interval-bounded sailor assignment problem (Q2581609) (← links)
- Faster cut sparsification of weighted graphs (Q2696277) (← links)
- Random sampling in cut, flow, and network design problems (Q2817658) (← links)
- Routing in undirected graphs with constant congestion (Q2817791) (← links)
- Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding (Q3057092) (← links)
- (Q4941837) (← links)
- A framework for clustering massive graph streams (Q4969739) (← links)
- Ranking and Sparsifying a Connection Graph (Q4985350) (← links)
- Computing exact minimum cuts without knowing the graph (Q4993305) (← links)
- Unit Capacity Maxflow in Almost $m^{4/3}$ Time (Q5071088) (← links)
- (Q5090924) (← links)
- On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem (Q5191123) (← links)
- Hallucination Helps: Energy Efficient Virtual Circuit Routing (Q5210552) (← links)
- (Q5214203) (← links)
- A General Framework for Graph Sparsification (Q5232324) (← links)
- Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs (Q5252687) (← links)
- Fast Augmenting Paths by Random Sampling from Residual Graphs (Q5252688) (← links)
- STACS 2005 (Q5710711) (← links)
- (Q5743414) (← links)
- Fixed parameter approximation scheme for min-max \(k\)-cut (Q5925652) (← links)
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing (Q6550988) (← links)
- Near-optimal distributed computation of small vertex cuts (Q6579850) (← links)
- Minimum cut in \(O(m \log^2 n)\) time (Q6614613) (← links)
