Pages that link to "Item:Q5248541"

The following pages link to Approximate max-flow min-(multi)cut theorems and their applications (Q5248541):

Displaying 26 items.

• Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems (Q295639) (← links)
• A derandomized approximation algorithm for the critical node detection problem (Q336925) (← links)
• A randomized algorithm with local search for containment of pandemic disease spread (Q337036) (← links)
• Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443) (← links)
• Improved bounds for the max-flow min-multicut ratio for planar and \(K_{r,r}\)-free graphs (Q685479) (← links)
• Scheduling multicasts on unit-capacity trees and meshes. (Q1401961) (← links)
• Colocating tasks in data centers using a side-effects performance model (Q1754339) (← links)
• Stabilizing network bargaining games by blocking players (Q1801001) (← links)
• A penalty function heuristic for the resource constrained shortest path problem (Q1848355) (← links)
• An approximate max-flow min-cut relation for undirected multicommodity flow, with applications (Q1894701) (← links)
• The geometry of graphs and some of its algorithmic applications (Q1894703) (← links)
• Improved bounds on the max-flow min-cut ratio for multicommodity flows (Q1900189) (← links)
• Correlation clustering in data streams (Q2037102) (← links)
• The ferry cover problem (Q2272191) (← links)
• A simple algorithm for the multiway cut problem (Q2294387) (← links)
• A Mixed Integer Model for the Sparsest Cut problem (Q2883559) (← links)
• A Region Growing Algorithm for Detecting Critical Nodes (Q2942434) (← links)
• Stabilizing Network Bargaining Games by Blocking Players (Q3186500) (← links)
• Polynomial time approximation schemes for dense instances of minimum constraint satisfaction (Q4417004) (← links)
• Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover (Q4630249) (← links)
• Multiway cuts in directed and node weighted graphs (Q4632450) (← links)
• Primal-dual approximation algorithms for feedback problems in planar graphs (Q4645920) (← links)
• Approximating minimum feedback sets and multi-cuts in directed graphs (Q5101402) (← links)
• Nonlinear formulations and improved randomized approximation algorithms for multicut problems (Q5101403) (← links)
• Computation in Causal Graphs (Q5377356) (← links)
• Advances in metric embedding theory (Q5894374) (← links)