7129 search results - page 225 / 1426 » Approximation Algorithms for Treewidth |
194
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
134
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...
150
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
134
Voted
SODA
1998
ACM
15 years 5 months ago
1998
ACM
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
139
click to vote
ICIP
2005
IEEE
16 years 5 months ago
2005
IEEE
In this paper the blind deconvolution problem is formulated using the variational framework. With its use approximations of the involved probability distributions are developed re...