61 search results - page 7 / 13 » soda 2001 |
SODA
2001
ACM
14 years 7 days 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...
SODA
2001
ACM
14 years 7 days ago
2001
ACM
We address a longstanding open problem of [11, 10], and present a general transformation that transforms any pointer based data structure to be confluently persistent. Such transf...
SODA
2001
ACM
14 years 7 days ago
2001
ACM
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
SODA
2001
ACM
14 years 7 days ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
SODA
2001
ACM
14 years 7 days ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...