7129 search results - page 246 / 1426 » Approximation Algorithms for Treewidth |
114
click to vote
DAGSTUHL
2007
15 years 5 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
145
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
127
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—This paper presents an approximate belief propagation algorithm that replaces outgoing messages from a node with the averaged outgoing message and propagates messages fr...
163
Voted
WAOA
2010
Springer
15 years 1 months ago
2010
Springer
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
156
click to vote
SIAMJO
2011
14 years 10 months ago
2011
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...