7129 search results - page 309 / 1426 » Approximation Algorithms for Treewidth |
129
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
—We investigate approximating joint distributions of random processes with causal dependence tree distributions. Such distributions are particularly useful in providing parsimoni...
152
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
131
Voted
COMGEO
1999
ACM
15 years 4 months ago
1999
ACM
This paper discusses algorithms for labeling sets of points in the plane, where labels are not restricted to some finite number of positions. We show that continuously sliding lab...
126
click to vote
WAOA
2007
Springer
15 years 10 months ago
2007
Springer
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
146
click to vote
COR
2007
15 years 4 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...