642 search results - page 67 / 129 » Approximation Algorithms for Minimum K-Cut |
JCO
2006
14 years 11 months ago
2006
Abstract. We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection ...
133
click to vote
PPOPP
2011
ACM
14 years 2 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
100
click to vote
IPPS
2010
IEEE
14 years 9 months ago
2010
IEEE
We consider the problem of scheduling jobs on a pool of machines. Each job requires multiple machines on which it executes in parallel. For each job, the input specifies release ti...
97
Voted
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
103
click to vote
DAM
2010
14 years 12 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...