791 search results - page 4 / 159 » Approximating the Maximum Sharing Problem |
TALG
2010
14 years 10 months ago
2010
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
SIGMOD
2008
ACM
14 years 11 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
112
click to vote
WADS
2007
Springer
15 years 5 months ago
2007
Springer
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...