Results 1  10
of
126
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
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...
QueryCompetitive Algorithms for Cheapest Set Problems under Uncertainty
"... Abstract. Considering the model of computing under uncertainty where element weights are uncertain but can be obtained at a cost by query operations, we study the problem of identifying a cheapest (minimumweight) set among a given collection of feasible sets using a minimum number of queries of ele ..."
Abstract
 Add to MetaCart
of element weights. For the general case we present an algorithm that makes at most d · OPT + d queries, where d is the maximum cardinality of any given set and OPT is the optimal number of queries needed to identify a cheapest set. For the minimum multicut problem in trees with d terminal pairs, we give
1The Switching Threshold Reconstruction Problem for Piecewise Affine Models of Genetic Regulatory Networks
"... Abstract — Recent advances of experimental techniques in biology have led to the production of enormous amounts of data on the dynamics of genetic regulatory networks. We present an approach for the identification of PieceWiseAffine (PWA) models of genetic regulatory networks from experimental dat ..."
Abstract
 Add to MetaCart
data, focusing on the reconstruction of switching thresholds associated with regulatory interactions. In particular, our method takes into account geometric constraints specific to models of genetic regulatory networks. We show the feasibility of our approach by the reconstruction of switching
Functional map networks for analyzing and exploring large shape collections
 ACM TOG
, 2014
"... Copyright Notice ..."
Results 1  10
of
126