13 search results - page 2 / 3 » The descent set polynomial revisited |
SIAMCOMP
2008
13 years 5 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
NETWORKS
2006
13 years 5 months ago
2006
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
PAIRING
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...