scientific article

From MaRDI portal
Publication:4035360

zbMath0821.90125MaRDI QIDQ4035360

William H. Cunningham

Publication date: 18 May 1993


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (25)

Parameterized graph separation problemsOn weighted multiway cuts in treesOn the (near) optimality of extended formulations for multi-way cut in social networksA lower bound of \(8/(7+\frac{1}{k-1})\) on the integrality ratio of the Călinescu-Karloff-Rabani relaxation for multiway cutOn generalized greedy splitting algorithms for multiway partition problemsApproximation algorithms for treewidthAn improved parameterized algorithm for the minimum node multiway cut problemExtended formulations for the \(A\)-cut problemA new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithmsThe planar multiterminal cut problemNonlinear formulations and improved randomized approximation algorithms for multicut problemsFission: Practical algorithms for computing minimum balanced node separatorsAn \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problemThe multi-terminal vertex separator problem: polyhedral analysis and branch-and-cutMultiway cuts in directed and node weighted graphsOptimal cuts in graphs and statistical mechanicsOptimal 3-terminal cuts and linear programmingA sufficiently fast algorithm for finding close to optimal clique treesMinimal multicut and maximal integer multiflow: a surveySolution methods for the vertex variant of the network system vulnerability analysis problemInequity aversion pricing over social networks: approximation algorithms and hardness resultsOn the complexity of finding balanced oneway cutsMinimum multiway cuts in treesAn improved approximation algorithm of MULTIWAY CUT.Multiway cut and integer flow problems in trees




This page was built for publication: