Pages that link to "Item:Q4305362"
From MaRDI portal
The following pages link to The Complexity of Multiterminal Cuts (Q4305362):
Displaying 50 items.
- Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
- The planar multiterminal cut problem (Q1130183) (← links)
- Minimum multiway cuts in trees (Q1270773) (← links)
- Metrics with finite sets of primitive extensions (Q1293426) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- On weighted multiway cuts in trees (Q1334954) (← links)
- An improved approximation algorithm of MULTIWAY CUT. (Q1577011) (← links)
- A characterization of minimizable metrics in the multifacility location problem (Q1582478) (← links)
- On embedding complete graphs into hypercubes (Q1584282) (← links)
- A new approach for the multiobjective minimum spanning tree (Q1651644) (← links)
- The convexity of induced paths of order three and applications: complexity aspects (Q1701089) (← links)
- Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm (Q1704922) (← links)
- The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut (Q1728091) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- Improved approximation algorithms for the maximum happy vertices and edges problems (Q1750352) (← links)
- L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem (Q1751126) (← links)
- An FPT algorithm for planar multicuts with sources and sinks on the outer face (Q1755788) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- Greedy splitting algorithms for approximating multiway partition problems (Q1769071) (← links)
- Parameterized complexity of length-bounded cuts and multicuts (Q1799212) (← links)
- Evolutionary trees: An integer multicommodity max-flow -- min-cut theorem (Q1802347) (← links)
- A greedy algorithm for multicut and integral multiflow in rooted trees (Q1869999) (← links)
- Some constrained partitioning problems and majorization (Q1876140) (← links)
- On generalized greedy splitting algorithms for multiway partition problems (Q1887049) (← links)
- Hard cases of the multifacility location problem (Q1887076) (← links)
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms (Q1917270) (← links)
- Multiterminal flows and cuts (Q1924611) (← links)
- A golden ratio parameterized algorithm for cluster editing (Q1932356) (← links)
- Two-stage robust network design with exponential scenarios (Q1939662) (← links)
- Hardness of approximation for crossing number (Q1943651) (← links)
- Models and methods for solving the problem of network vulnerability (Q1951863) (← links)
- Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501) (← links)
- Complexity and characterization aspects of edge-related domination for graphs (Q2023127) (← links)
- Inequity aversion pricing over social networks: approximation algorithms and hardness results (Q2031049) (← links)
- Minimum 0-extension problems on directed metrics (Q2042078) (← links)
- Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem (Q2082183) (← links)
- Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties (Q2082211) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- Königsberg sightseeing: Eulerian walks in temporal graphs (Q2115887) (← links)
- A graph theoretical approach to the firebreak locating problem (Q2124231) (← links)
- Solving \((k-1)\)-stable instances of \texttt{k-terminal cut} with isolating cuts (Q2125213) (← links)
- On the (near) optimality of extended formulations for multi-way cut in social networks (Q2129209) (← links)
- \(\ell_p\)-norm multiway cut (Q2165036) (← links)
- Complexity of paired domination in AT-free and planar graphs (Q2166758) (← links)
- Placing quantified variants of 3-SAT and \textsc{not-all-equal} 3-SAT in the polynomial hierarchy (Q2182311) (← links)
- Partitioning sparse graphs into an independent set and a graph with bounded size components (Q2185923) (← links)
- On integer and bilevel formulations for the \(k\)-vertex cut problem (Q2195678) (← links)
- A tight \(\sqrt{2} \)-approximation for linear 3-cut (Q2205984) (← links)
- Geometric multicut: shortest fences for separating groups of objects in the plane (Q2207588) (← links)
- Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs (Q2211354) (← links)
