Results 1  10
of
305
Treewidth reduction for the parameterized Multicut problem
, 2010
"... The parameterized Multicut problem consists in deciding, given a graph, a set of requests (i.e. pairs of vertices) and an integer k, whether there exists a set of k edges which disconnects the two endpoints of each request. Determining whether Multicut is FixedParameter Tractable with respect to k ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The parameterized Multicut problem consists in deciding, given a graph, a set of requests (i.e. pairs of vertices) and an integer k, whether there exists a set of k edges which disconnects the two endpoints of each request. Determining whether Multicut is FixedParameter Tractable with respect to k
Macroscopic Loop Amplitudes in the MultiCut TwoMatrix Models
, 2009
"... Multicut critical points and their macroscopic loop amplitudes are studied in the multicut twomatrix models, based on an extension of the prescription developed by Daul, Kazakov and Kostov. After identifying possible critical points and potentials in the multicut matrix models, we calculate the ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Multicut critical points and their macroscopic loop amplitudes are studied in the multicut twomatrix models, based on an extension of the prescription developed by Daul, Kazakov and Kostov. After identifying possible critical points and potentials in the multicut matrix models, we calculate
Multicuts in Planar and BoundedGenus Graphs with Bounded Number of Terminals
, 2015
"... Given an undirected, edgeweighted graph G together with pairs of vertices, called pairs of terminals, the minimum multicut problem asks for a minimumweight set of edges such that, after deleting these edges, the two terminals of each pair belong to different connected components of the graph. Rely ..."
Abstract
 Add to MetaCart
Given an undirected, edgeweighted graph G together with pairs of vertices, called pairs of terminals, the minimum multicut problem asks for a minimumweight set of edges such that, after deleting these edges, the two terminals of each pair belong to different connected components of the graph
The Resurgence of Instantons: Multi–Cuts Stokes Phases and the Painleve ́ II Equation
"... Abstract: Resurgent transseries have recently been shown to be a very powerful construction in order to completely describe nonperturbative phenomena in both matrix models and topological or minimal strings. These solutions encode the full nonperturbative content of a given gauge or string theory, w ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
study of Stokes phases associated to multi–cuts solutions of generic matrix models, constructing nonperturbative solutions for their free energies and exploring the asymptotic large–order behavior around distinct multi–instanton sectors. Explicit formulae are presented for the Z2 symmetric two–cuts set
Genus one correlation to multicut matrix model solutions L. Chekhov 1
, 2004
"... We calculate genus one corrections to Hermitian onematrix model solution with arbitrary number of cuts directly from the loop equation confirming the answer previously obtained from algebrogeometrical considerations and generalizing it to the case of arbitrary potentials. 1 ..."
Abstract
 Add to MetaCart
We calculate genus one corrections to Hermitian onematrix model solution with arbitrary number of cuts directly from the loop equation confirming the answer previously obtained from algebrogeometrical considerations and generalizing it to the case of arbitrary potentials. 1
Preprint typeset in JHEP style PAPER VERSION CERNPHTH/2008186 Multi–Instantons and Multi–Cuts
, 809
"... Abstract: We discuss various aspects of multi–instanton configurations in generic multi–cut matrix models. Explicit formulae are presented in the two–cut case and, in particular, we obtain general formulae for multi–instanton amplitudes in the one–cut matrix model case as a degeneration of the two–c ..."
Abstract
 Add to MetaCart
Abstract: We discuss various aspects of multi–instanton configurations in generic multi–cut matrix models. Explicit formulae are presented in the two–cut case and, in particular, we obtain general formulae for multi–instanton amplitudes in the one–cut matrix model case as a degeneration of the two
Rounding algorithms for a geometric embedding of minimum multiway cut
 In STOC ’99: Proceedings of the 31st Annual ACM Symposium on Theory of Computing
, 1999
"... Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or kway, cut is a subset of the edges whose removal disconnects each terminal from the others. The multiway cut problem is to find a minimumcost multiway cut. This problem is MaxSNP hard. Recently ..."
Abstract

Cited by 50 (2 self)
 Add to MetaCart
Calinescu, Karloff, and Rabani (STOC’98) gave a novel geometric relaxation of the problem and a rounding scheme that produced a (3/2 − 1/k)approximation algorithm. In this paper, we study their geometric relaxation. In particular, we study the worstcase ratio between the value of the relaxation
Multicommodity Flows and Approximation Algorithms
, 1994
"... This thesis is about multicommodity flows and their use in designing approximation algorithms for problems involving cuts in graphs. In a groundbreaking work Leighton and Rao [34] showed an approximate maxflow mincut theorem for uniform multicommodity flow and used this to obtain an approximation ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
of the approximate maxflow minmulticut theorem and a geometric scaling technique from [1] to provi...
Results 1  10
of
305