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.
- On the (near) optimality of extended formulations for multi-way cut in social networks (Q2129209) (← links)
- The max-flow min-cut property and \(\pm 1\)-resistant sets (Q2217497) (← links)
- Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth (Q2290633) (← links)
- Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
- Approximating directed multicuts (Q2387182) (← links)
- Correlation clustering in general weighted graphs (Q2503347) (← links)
- Clustering with qualitative information (Q2568462) (← links)
- Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376) (← links)
- The maximum integer multiterminal flow problem in directed graphs (Q2643793) (← links)
- Robust critical node selection by Benders decomposition (Q2806873) (← links)
- Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs (Q2813347) (← links)
- Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- The Complexity and Approximability of Minimum Contamination Problems (Q3010410) (← links)
- Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing (Q3113678) (← links)
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms (Q3158558) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs (Q3439308) (← links)
- Fast First-Order Algorithms for Packing–Covering Semidefinite Programs (Q3454972) (← links)
- (Q3995567) (← links)
- (Q4035662) (← links)
- Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem (Q4577771) (← links)
- Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
- Multicut Is FPT (Q4605273) (← links)
- An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications (Q4806910) (← links)
- EFFICIENT APPROXIMATION ALGORITHMS FOR PAIRWISE DATA CLUSTERING AND APPLICATIONS (Q4818598) (← links)
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (Q4986808) (← links)
- Simplex Transformations and the Multiway Cut Problem (Q5000653) (← links)
- Multi-Budgeted Directed Cuts (Q5009480) (← links)
- (Q5009491) (← links)
- Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation (Q5041741) (← links)
- (Q5089231) (← links)
- A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals (Q5149755) (← links)
- Hallucination Helps: Energy Efficient Virtual Circuit Routing (Q5210552) (← links)
- Streaming Lower Bounds for Approximating MAX-CUT (Q5363106) (← links)
- The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case (Q5449665) (← links)
- A New Min‐Cut Max‐Flow Ratio for Multicommodity Flows (Q5454255) (← links)
- Approximation Algorithms for k-Hurdle Problems (Q5458550) (← links)
- (Q5743380) (← links)
- (Q5743436) (← links)
- (Q5743437) (← links)
- Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow (Q5874526) (← links)
- (Q5875482) (← links)
- A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)
- Vertex downgrading to minimize connectivity (Q6038644) (← links)
- Approximating Requirement Cut via a Configuration LP (Q6084417) (← links)
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes (Q6098156) (← links)
- Approximating maximum integral multiflows on bounded genus graphs (Q6142346) (← links)
- On the dominant of the multicut polytope (Q6624194) (← links)
- Fitting metrics and ultrametrics with minimum disagreements (Q6670352) (← links)
