Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Gupta, Anupam"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A randomized
O(\log^2k)
-competitive algorithm for metric bipartite matching
Nikhil Bansal
,
Niv Buchbinder
,
Anupam Gupta
,
Joseph (Seffi) Naor
Algorithmica
68
(2), 2014, pp. 390-403
Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
Guy E. Blelloch
,
Anupam Gupta
,
Ioannis Koutis
,
Gary L. Miller
,
Richard Peng
,
Kanat Tangwongsan
Theory of Computing Systems
55
(3), 2014, pp. 521-554
Vertex sparsifiers: New results from old techniques
Matthias Englert
,
Anupam Gupta
,
Robert Krauthgamer
,
Harald Räcke
,
Inbal Talgam-Cohen
,
Kunal Talwar
SIAM Journal on Computing
43
(4), 2014, pp. 1239-1262
How experts can solve LPs online
Anupam Gupta
,
Marco Molinaro
Lecture Notes in Computer Science
8737
, 2014, pp. 517-529
Changing bases: Multistage optimization for matroids and matchings
Anupam Gupta
,
Kunal Talwar
,
Udi Wieder
Lecture Notes in Computer Science
8572
, 2014, pp. 563-575
Algorithms for hub label optimization
Maxim Babenko
,
Andrew V. Goldberg
,
Anupam Gupta
,
Viswanath Nagarajan
Lecture Notes in Computer Science
7965
, 2013, pp. 69-80
Clustering under approximation stability
Maria-Florina Balcan
,
Avrim Blum
,
Anupam Gupta
Journal of the ACM
60
(2), 2013, pp. 8: 1-34
Packing interdiction and partial covering problems
Michael Dinitz
,
Anupam Gupta
Lecture Notes in Computer Science
7801
, 2013, pp. 157-168
An improved integrality gap for asymmetric TSP paths
Zachary Friggstad
,
Anupam Gupta
,
Mohit Singh
Lecture Notes in Computer Science
7801
, 2013, pp. 181-192
Set covering with our eyes closed
Fabrizio Grandoni
,
Anupam Gupta
,
Stefano Leonardi
,
Pauli Miettinen
,
Piotr Sankowski
,
Mohit Singh
SIAM Journal on Computing
42
(3), 2013, pp. 808-830
The power of deferral: Maintaining a constant-competitive Steiner tree online
Albert Gu
,
Anupam Gupta
,
Amit Kumar
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 525-534
Privately releasing conjunctions and the statistical query barrier
Anupam Gupta
,
Moritz Hardt
,
Aaron Roth
,
Jonathan Ullman
SIAM Journal on Computing
42
(4), 2013, pp. 1494-1520
Thrifty algorithms for multistage robust optimization
Anupam Gupta
,
Viswanath Nagarajan
,
Vijay V. Vazirani
Lecture Notes in Computer Science
7801
, 2013, pp. 217-228
A stochastic probing problem with applications
Anupam Gupta
,
Viswanath Nagarajan
Lecture Notes in Computer Science
7801
, 2013, pp. 205-216
Sparsest cut on bounded treewidth graphs: Algorithms and hardness results
Anupam Gupta
,
Kunal Talwar
,
David Witmer
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 281-290
When LP is the cure for your matching woes: Improved bounds for stochastic matchings
Nikhil Bansal
,
Anupam Gupta
,
Jian Li
,
Julián Mestre
,
Viswanath Nagarajan
,
Atri Rudra
Algorithmica
63
(4), 2012, pp. 733-762
Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design
Guy E. Blelloch
,
Anupam Gupta
,
Kanat Tangwongsan
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2012 (Pittsburgh, Pennsylvania, USA, June 25-27, 2012)
, 2012, pp. 205-213
Approximating TSP on metrics with bounded global growth
T.-H. Hubert Chan
,
Anupam Gupta
SIAM Journal on Computing
41
(3), 2012, pp. 587-617
The online metric matching problem for doubling metrics
Anupam Gupta
,
Kevin Lewi
Lecture Notes in Computer Science
7391
, 2012, pp. 424-435
Approximating sparse covering integer programs online
Anupam Gupta
,
Viswanath Nagarajan
Lecture Notes in Computer Science
7391
, 2012, pp. 436-448
Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
Guy E. Blelloch
,
Anupam Gupta
,
Ioannis Koutis
,
Gary L. Miller
,
Richard Peng
,
Kanat Tangwongsan
Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011)
, 2011, pp. 13-22
Privately releasing conjunctions and the statistical query barrier
Anupam Gupta
,
Moritz Hardt
,
Aaron Roth
,
Jonathan Ullman
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 803-812
Sampling and cost-sharing: Approximation algorithms for stochastic optimization problems
Anupam Gupta
,
Martin Pál
,
R. Ravi
,
Amitabh Sinha
SIAM Journal on Computing
40
(5), 2011, pp. 1361-1401
Making doubling metrics geodesic
Anupam Gupta
,
Kunal Talwar
Algorithmica
59
(1), 2011, pp. 66-80
When LP is the cure for your matching woes: Improved bounds for stochastic matchings
Nikhil Bansal
,
Anupam Gupta
,
Jian Li
,
Julián Mestre
,
Viswanath Nagarajan
,
Atri Rudra
Lecture Notes in Computer Science
6347
, 2010, pp. 218-229
Seiten 1
2
3
>