Results 1 
3 of
3
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
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 5 (0 self)
 Add to MetaCart
of the approximate maxflow minmulticut theorem and a geometric scaling technique from [1] to provi...