Pages that link to "Item:Q4877516"
From MaRDI portal
The following pages link to Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications (Q4877516):
Displaying 50 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network (Q320688) (← links)
- Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing (Q372974) (← links)
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- An approximation algorithm for the generalized \(k\)-multicut problem (Q423940) (← links)
- Restricted vertex multicut on permutation graphs (Q444445) (← links)
- On the advantage of overlapping clusters for minimizing conductance (Q472486) (← links)
- Finding the closest ultrametric (Q476304) (← links)
- A measure-theoretical max-flow-min-cut problem (Q583082) (← links)
- Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
- Approximation and hardness results for label cut and related problems (Q630189) (← links)
- A unified approach to approximating partial covering problems (Q633845) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443) (← links)
- Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
- The multi-terminal maximum-flow network-interdiction problem (Q713097) (← links)
- The checkpoint problem (Q714790) (← links)
- A node-capacitated Okamura-Seymour theorem (Q747769) (← links)
- Multi-budgeted directed cuts (Q786027) (← links)
- On the Max-flow min-cut ratio for directed multicommodity flows (Q818146) (← links)
- Approximating the maximum agreement forest on \(k\) trees (Q835040) (← links)
- Approximation algorithms for requirement cut on graphs (Q848961) (← links)
- Partial multicuts in trees (Q861281) (← links)
- The multi-multiway cut problem (Q884458) (← links)
- Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
- Exact and approximate resolution of integral multiflow and multicut problems: Algorithms and complexity (Q926573) (← links)
- On the complexity of the multicut problem in bounded tree-width graphs and digraphs (Q944745) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- Min sum clustering with penalties (Q976485) (← links)
- Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
- Constant ratio fixed-parameter approximation of the edge multicut problem (Q990949) (← links)
- Approximation algorithms for the Bipartite Multicut problem (Q991784) (← links)
- Path hitting in acyclic graphs (Q1018049) (← links)
- A simple algorithm for multicuts in planar graphs with outer terminals (Q1026166) (← links)
- Multicuts and integral multiflows in rings (Q1041998) (← links)
- Maximum concurrent flows and minimum cuts (Q1194345) (← links)
- Approximation algorithms for min-sum \(p\)-clustering (Q1281390) (← links)
- An improved approximation algorithm of MULTIWAY CUT. (Q1577011) (← links)
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
- Metric decompositions of path-separable graphs (Q1679219) (← links)
- On the Langberg-Médard multiple unicast conjecture (Q1679506) (← links)
- Approximating a generalization of MAX 2SAT and MIN 2SAT (Q1841882) (← links)
- Logical analysis of data with decomposable structures. (Q1853578) (← links)
- A greedy algorithm for multicut and integral multiflow in rooted trees (Q1869999) (← links)
- On local search for the generalized graph coloring problem (Q1870000) (← links)
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications (Q1894701) (← links)
- Improved bounds on the max-flow min-cut ratio for multicommodity flows (Q1900189) (← links)
- Models and methods for solving the problem of network vulnerability (Q1951863) (← links)
- On complexity, representation and approximation of integral multicommodity flows (Q1962043) (← links)
- Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties (Q2082211) (← links)
- Integer plane multiflow maximisation: one-quarter-approximation and gaps (Q2089777) (← links)
