7129 search results - page 88 / 1426 » Approximation Algorithms for Treewidth |
107
click to vote
SODA
1997
ACM
15 years 4 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
168
click to vote
COCOON
2004
Springer
15 years 8 months ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
116
click to vote
SIAMCOMP
2010
14 years 9 months ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
108
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
125
click to vote
PKDD
2009
Springer
15 years 9 months ago
2009
Springer
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...