Result 1 to 20 of 86 total
Making doubling metrics geodesic. (English)
Algorithmica 59, No. 1, 66-80 (2011).
1
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. (English)
Combinatorica 30, No. 5, 485-520 (2010).
2
Constrained non-monotone submodular maximization: offline and secretary algorithms. (English)
Saberi, Amin (ed.), Internet and network economics. 6th international workshop, WINE 2010, Stanford, CA, USA, December 13‒17, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-17571-8/pbk). Lecture Notes in Computer Science 6484, 246-257 (2010).
3
Improving integrality gaps via Chvátal-Gomory rounding. (English)
Serna, Maria (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, Barcelona, Spain, September 1‒3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15368-6/pbk). Lecture Notes in Computer Science 6302, 366-379 (2010).
4
Vertex sparsifiers: new results from old techniques. (English)
Serna, Maria (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, Barcelona, Spain, September 1‒3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15368-6/pbk). Lecture Notes in Computer Science 6302, 152-165 (2010).
5
Vertex sparsifiers: new results from old techniques. (English)
Comput. Res. Repos. 2010, Article No. 1006.4586 (2010).
6
Lower bounds on near neighbor search via metric expansion. (English)
Comput. Res. Repos. 2010, Article No. 1005.0418 (2010).
7
Constrained non-monotone submodular maximization: offline and secretary algorithms. (English)
Comput. Res. Repos. 2010, Article No. 1003.1517 (2010).
8
Ultra-low-dimensional embeddings for doubling metrics. (English)
J. ACM 57, No. 4 (2010).
9
Differentially private combinatorial optimization (English)
SODA, 1106-1125 (2010).
10
The (1 + beta)-choice process and weighted balls-into-bins (English)
SODA, 1613-1619 (2010).
11
Constrained non-monotone submodular maximization: offline and secretary algorithms (English)
WINE, 246-257 (2010).
12
Improving integrality gaps via Chvàtal-gomory rounding (English)
APPROX-RANDOM, 366-379 (2010).
13
Vertex sparsifiers: new results from old techniques (English)
APPROX-RANDOM, 152-165 (2010).
14
Hard instances for satisfiability and quasi-one-way functions (English)
ICS, 290-300 (2010).
15
Lower bounds on near neighbor search via metric expansion (English)
FOCS, 805-814 (2010).
16
The limits of two-party differential privacy (English)
FOCS, 81-90 (2010).
17
On the geometry of differential privacy (English)
STOC, 705-714 (2010).
18
On the geometry of differential privacy. (English)
Comput. Res. Repos. 2009, Article No. 0907.3754 (2009).
19
Differentially private approximation algorithms. (English)
Comput. Res. Repos. 2009, Article No. 0903.4510 (2009).
20
Result 1 to 20 of 86 total