Pages that link to "Item:Q679443"
From MaRDI portal
The following pages link to Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443):
Displaying 50 items.
- An FPT algorithm for planar multicuts with sources and sinks on the outer face (Q1755788) (← links)
- New algorithms for maximum disjoint paths based on tree-likeness (Q1785205) (← links)
- A greedy algorithm for multicut and integral multiflow in rooted trees (Q1869999) (← links)
- Call control with \(k\) rejections (Q1877703) (← links)
- On complexity, representation and approximation of integral multicommodity flows (Q1962043) (← links)
- Solution methods for the vertex variant of the network system vulnerability analysis problem (Q2017536) (← links)
- On structural parameterizations of the edge disjoint paths problem (Q2032342) (← links)
- Maximum edge-disjoint paths in planar graphs with congestion 2 (Q2039241) (← links)
- A simple rounding scheme for multistage optimization (Q2077374) (← 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)
- An approximation algorithm for the \(k\)-prize-collecting multicut on a tree problem (Q2205937) (← links)
- Max-multiflow/min-multicut for G+H series-parallel (Q2275455) (← links)
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
- Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth (Q2290633) (← links)
- A logical approach to multicut problems (Q2379958) (← links)
- Multicuts in planar and bounded-genus graphs with bounded number of terminals (Q2408168) (← links)
- On the generalized multiway cut in trees problem (Q2436662) (← links)
- Cut problems in graphs with a budget constraint (Q2457298) (← links)
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149) (← links)
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm (Q2466394) (← links)
- Path problems in generalized stars, complete graphs, and brick wall graphs (Q2489960) (← links)
- Correlation clustering in general weighted graphs (Q2503347) (← links)
- Clustering with qualitative information (Q2568462) (← links)
- The maximum integer multiterminal flow problem in directed graphs (Q2643793) (← links)
- The power of cut-based parameters for computing edge-disjoint paths (Q2659778) (← links)
- The connected critical node problem (Q2672625) (← links)
- Improved algorithms for scheduling unsplittable flows on paths (Q2684488) (← links)
- Half-integrality, LP-branching, and FPT algorithms (Q2816829) (← links)
- Routing in undirected graphs with constant congestion (Q2817791) (← links)
- New results on planar and directed multicuts (Q2851464) (← links)
- Routing concurrent video signals over SDH networks (Q2883647) (← links)
- Parameterized Maximum Path Coloring (Q2891353) (← links)
- How to Cut a Graph into Many Pieces (Q3010400) (← links)
- Wavelength assignment in multifiber star networks (Q3057165) (← links)
- Line planning, path constrained network flow and inapproximability (Q3076020) (← links)
- Primal-dual approximation algorithms for a packing-covering pair of problems (Q3148377) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths (Q3388417) (← links)
- Multiway cut and integer flow problems in trees (Q3439138) (← links)
- Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs (Q3439308) (← links)
- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees (Q3512469) (← links)
- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees (Q3602825) (← links)
- All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs (Q4577772) (← links)
- Multicut Is FPT (Q4605273) (← links)
- (Q4636548) (← links)
- Primal-dual approximation algorithms for feedback problems in planar graphs (Q4645920) (← links)
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (Q4986808) (← links)
- Superlinear Integrality Gaps for the Minimum Majority Problem (Q5020845) (← links)
- Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation (Q5041741) (← links)
