Pages that link to "Item:Q4632450"

The following pages link to Multiway cuts in directed and node weighted graphs (Q4632450):

Displaying 19 items.

• An extended network interdiction problem for optimal toll control (Q325471) (← links)
• The complexity of multicut and mixed multicut problems in (di)graphs (Q391767) (← links)
• FPT algorithms for path-transversal and cycle-transversal problems (Q456698) (← links)
• The multi-terminal vertex separator problem: branch-and-cut-and-price (Q827608) (← links)
• Eisenberg-Gale markets: algorithms and game-theoretic properties (Q993788) (← links)
• Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
• The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut (Q1728091) (← links)
• Logical analysis of data with decomposable structures. (Q1853578) (← links)
• On generalized greedy splitting algorithms for multiway partition problems (Q1887049) (← links)
• Exact and approximation algorithms for sensor placement against DDoS attacks (Q2140977) (← links)
• On integer and bilevel formulations for the \(k\)-vertex cut problem (Q2195678) (← links)
• Beating the 2-approximation factor for global bicut (Q2316621) (← links)
• The vertex \(k\)-cut problem (Q2419357) (← links)
• The maximum integer multiterminal flow problem in directed graphs (Q2643793) (← links)
• FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs (Q3503584) (← links)
• Hypergraph Cuts with General Splitting Functions (Q5094916) (← links)
• Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
• (Q5743512) (← links)
• A sufficiently fast algorithm for finding close to optimal clique trees (Q5940778) (← links)