626 search results - page 30 / 126 » On Approximability of Minimum Bisection Problem |
CDC
2009
IEEE
14 years 14 days ago
2009
IEEE
This paper addresses the state estimation problem of nonlinear systems. We formulate the problem using a minimum energy estimator (MEE) approach and propose an entropy penalized sc...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
DISOPT
2010
13 years 8 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
EOR
2007
13 years 8 months ago
2007
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...