2069 search results - page 168 / 414 » Linear time algorithms for Clobber |
137
Voted
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
146
click to vote
DISOPT
2007
15 years 4 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
119
click to vote
TIT
2008
15 years 4 months ago
2008
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
171
click to vote
ICALP
1994
Springer
15 years 8 months ago
1994
Springer
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
127
click to vote
SODA
2001
ACM
15 years 6 months ago
2001
ACM
We introduce a new updatable representation ofbinary trees. The structure requires the information theoretic minimum 2n + o(n) bits and supports basic navigational operations in c...