447 search results - page 29 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
138
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
150
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
127
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...
149
Voted
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
144
Voted
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...