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.
- 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)
- Designing WDM optical networks using branch-and-price (Q387309) (← links)
- Parameterized maximum path coloring (Q392021) (← links)
- An approximation algorithm for the generalized \(k\)-multicut problem (Q423940) (← links)
- Multicut in trees viewed through the eyes of vertex cover (Q440014) (← links)
- Restricted vertex multicut on permutation graphs (Q444445) (← links)
- Tree metrics and edge-disjoint \(S\)-paths (Q463719) (← links)
- On the advantage of overlapping clusters for minimizing conductance (Q472486) (← links)
- Evader interdiction: algorithms, complexity and collateral damage (Q490228) (← links)
- Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
- Complexity of the critical node problem over trees (Q547128) (← links)
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree (Q548676) (← 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)
- Approximability of sparse integer programs (Q634673) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
- The checkpoint problem (Q714790) (← links)
- On the hardness of finding near-optimal multicuts in directed acyclic graphs (Q719273) (← links)
- Multicommodity flows in tree-like networks (Q733946) (← links)
- Parameterized graph separation problems (Q820151) (← links)
- Hierarchical \(b\)-matching (Q831805) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- Finding disjoint paths with related path costs (Q857785) (← links)
- Partial multicuts in trees (Q861281) (← links)
- Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
- Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs (Q896267) (← links)
- Query-competitive algorithms for cheapest set problems under uncertainty (Q899309) (← links)
- Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs (Q924540) (← links)
- Exact and approximate resolution of integral multiflow and multicut problems: Algorithms and complexity (Q926573) (← links)
- Walrasian equilibrium: Hardness, approximations and tractable instances (Q943867) (← links)
- On the complexity of the multicut problem in bounded tree-width graphs and digraphs (Q944745) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- A preemptive algorithm for maximizing disjoint paths on trees (Q970615) (← links)
- Cardinality constrained and multicriteria (multi)cut problems (Q1013079) (← links)
- Path hitting in acyclic graphs (Q1018049) (← links)
- Improved algorithms for the multicut and multiflow problems in rooted trees (Q1024699) (← links)
- A simple algorithm for multicuts in planar graphs with outer terminals (Q1026166) (← links)
- Multicuts and integral multiflows in rings (Q1041998) (← links)
- Vertex covering by paths on trees with its applications in machine translation (Q1045903) (← links)
- A fixed-parameter tractability result for multicommodity demand flow in trees (Q1045910) (← links)
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
- Parameterized complexity and approximation issues for the colorful components problems (Q1643155) (← links)
- The bi-objective critical node detection problem (Q1681144) (← links)
- Constant-time local computation algorithms (Q1743110) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- Covering problems in edge- and node-weighted graphs (Q1751155) (← links)
