Gupthesis phdthesis Embeddings of Finite Metrics University of California, Berkeley August 2000 2000-08 DG99-old techreport A simple proof of the {Johnson-Lindenstrauss} lemma 1999 99-006 International Computer Science Institute 1999 DG99 article Random Structures Algorithms 1 943 859 An elementary proof of a theorem of {Johnson} and {Lindenstrauss} 1042-9832 60--65 22 Random Structures \& Algorithms 2003 1 60C05 (52B55) 2003 Gup99-conf inproceedings 1 798 093 Embedding tree metrics into low dimensional {Euclidean} spaces New York 694--700 1999 Proceedings of the 31st ACM Symposium on the Theory of Computing (STOC) 68U05 (54C25 54E35 65D18) ACM 1999 Gup99 article 0179-5376 105--116 1 68U05 (54C25 54E35) Discrete Comput. Geom. Embedding tree metrics into low-dimensional {Euclidean} spaces 2001b:68144 24 Discrete \& Computational Geometry. An International Journal of Mathematics and Computer Science 2000 DCGEER (Preliminary version in {\em 31st STOC}, 1999) 2000 GNRS99-conf inproceedings 1 917 578 Cuts, trees and {$\ell_1$}-embeddings of graphs 399--408 1999 Proceedings of the 40th Symposium on the Foundations of Computer Science (FOCS) 68R10 (05C85) IEEE Computer Soc., Los Alamitos, CA 1999 GNRS99 article Combinatorica Cuts, trees and {$\ell_1$}-embeddings of graphs 233--269 24 2004 2 (Preliminary version in 40th FOCS, 1999.) 2004 Gup00 inproceedings 1 755 540 Improved bandwidth approximation for trees New York 788--793 2000 Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA) 68R10 (68W20 68W25) ACM 2000 Gup00-jalg article 0196-6774 24--36 1 68R10 (05C85 68W25) J. Algorithms Improved bandwidth approximation for trees and chordal graphs 2002d:68079 40 Journal of Algorithms 2001 JOALDV (Preliminary version in {\em 11th SODA}, 2000) 2001 GT00 inproceedings A Constant Factor Approximation Algorithm for a Class of Classification Problems 652--658 2000 Proceedings of the 32nd ACM Symposium on the Theory of Computing (STOC) 2000 Gup01 inproceedings 1 958 411 Steiner points in tree metrics don't (really) help 220--227 2001 Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA) 05C85 (51E10) 2001 GKKRY01 inproceedings Provisioning a {Virtual Private Network}: {A} Network Design Problem for Multicommodity Flow 389--398 2001 Proceedings of the 33rd ACM Symposium on the Theory of Computing (STOC) 2001 GKmpls01-conf incollection 1 948 703 Traveling with a {Pez} dispenser (or, routing issues in {MPLS}) 148--157 2001 Proceedings of the 42nd Symposium on the Foundations of Computer Science (FOCS) 68M10 (68M12 68U35) IEEE Computer Soc., Los Alamitos, CA 2001 GKmpls01 article Ion-Lilian Florea SIAM J. Comput. MR2124013 (2006b:68011) Traveling with a {P}ez dispenser (or, routing issues in {MPLS}) 0097-5397 453--474 34 SIAM Journal on Computing 2 2004/05 68M12 (05C78 05C85 68W40) 2004/05 GKsort01 incollection 1 948 730 Sorting and selection with structured costs 416--425 2001 Proceedings of the 42nd Symposium on the Foundations of Computer Science (FOCS) 68P10 (68W40) IEEE Computer Soc., Los Alamitos, CA 2001 CCGKufp01-conf inproceedings Lecture Notes in Computer Science Approximation Algorithms for Unsplittable Flow Problems 51--66 2462 2002 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) 2002 CCGKufp01 article Algorithmica Approximation Algorithms for the Unsplittable Flow Problem 53--78 47 Algorithmica. An International Journal in Computer Science 1 2007 2007 CGKNR01-conf inproceedings Lecture Notes in Computer Science Building edge-failure resilient networks 439--456 2337 2002 Proceedings of the 9th Integer Programming and Combinatorial Optimization Conference (IPCO) 2002 CGKNR01 article Algorithmica MR2162270 Building edge-failure resilient networks 0178-4617 17--41 43 Algorithmica. An International Journal in Computer Science 1-2 2005 68M10 (68M15) ALGOEJ 2005 GKRinfocom03 inproceedings Exploring the Trade-off between Label Size and Stack Depth in {MPLS} Routing 544--554 1 2003 Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) 2003 KGR02 inproceedings A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem 333--342 2002 Proceedings of the 43rd Symposium on the Foundations of Computer Science (FOCS) 2002 AndoniDGIR03 inproceedings Lower Bounds for Embedding Edit Distance into Normed Spaces 523--526 2003 Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2003 CGNRS01-conf inproceedings Embedding $k$-outerplanar graphs into $\ell_1$ 527--536 2003 Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2003 CGNRS01 article SIAM J. Discrete Math. Embedding {$k$}-outerplanar graphs into {$\ell_1$} 119--136 20 SIAM Journal on Discrete Mathematics 1 2006 2006 GupDirMulticut01 inproceedings Improved Approximations for Directed Multicut 454--455 2003 Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2003 GuptaZane03 inproceedings Counting Inversions in Lists 253--254 2003 Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2003 GKTspaa03 inproceedings Tree based {MPLS} routing San Diego, California, USA 1-58113-661-7 193--199 2003 Proceedings of the 15th Annual ACM symposium on Parallel Algorithms and Architectures (SPAA) http://doi.acm.org/10.1145/777412.777443 ACM Press 2003 GKRstoc03 inproceedings Simpler and Better Approximation Algorithms for Network Design 365--372 2003 Proceedings of the 35th ACM Symposium on the Theory of Computing (STOC) 2003 GKL03 inproceedings Bounded geometries, fractals, and low--distortion embeddings 534--543 2003 Proceedings of the 44th Symposium on the Foundations of Computer Science (FOCS) 2003 GKPRmrob03 inproceedings Approximations via Cost-Sharing 606--615 2003 Proceedings of the 44th Symposium on the Foundations of Computer Science (FOCS) 2003 GKPR-JACM article J. ACM MR2314253 Approximation via cost sharing: simpler and better approximation algorithms for network design 0004-5411 Art. 11, 38 pp. 54 Journal of the ACM 3 2007 68W25 (68M10) 2007 GScovering03-conf inproceedings On the {Covering} {Steiner} Problem 244--251 2003 Proceedings of the 23rd Foundations of Software Technology and Theoretical Computer Science (FST\&TCS) 2003 GScovering03 article Theory of Computing An Improved Approximation Ratio for the {Covering} {Steiner} Problem 53--64 2 2006 2006 DGRstacs04-conf inproceedings Lecture Notes in Computer Science Approximation Algorithms for Minimizing Average Distortion 234--245 2996 2004 Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS) 2004 DGRstacs04 article Theory of Computing Systems Approximation Algorithms for Minimizing Average Distortion 93--111 39 1 2006 (Preliminary version in {\em 21st STACS}, 2004)", 2006 GPRSboost04 inproceedings Boosted Sampling: Approximation algorithms for stochastic optimization problems 417--426 2004 Proceedings of the 36th ACM Symposium on the Theory of Computing (STOC) 2004 GSTxmono04 article Algorithmica Cost-Sharing Mechanisms for Network Design. 98--119 50 Algorithmica. An International Journal in Computer Science 1 2008 2008 GSTxmono04-proc inproceedings Lecture Notes in Computer Science Cost-Sharing Mechanisms for Network Design. 139--150 3122 2004 Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) http://dx.doi.org/10.1007/s00453-007-9065-y 2004 CGKbidir05 article Discrete Appl. Math. On a bidirected relaxation for the {Multiway} {Cut} problem 67--79 150 Discrete Applied Mathematics. Combinatorial Algorithms, Optimization and Computer Science 1-3 2005 http://dx.doi.org/10.1016/j.dam.2005.04.003 2005 GRSfocs04-proc inproceedings An Edge in Time Saves Nine: {LP} Rounding Approximation Algorithms for Stochastic Network Design. 218--227 2004 Proceedings of the 45th Symposium on the Foundations of Computer Science (FOCS) 2004 GRSfocs04 article Mathematics of Operations Research {LP Rounding Approximation Algorithms for Stochastic Network Design} 345-364 32 2007 2 10.1287/moor.1060.0237 2007 CGMZ05 inproceedings On Hierarchical Routing in Doubling Metrics 762--771 2005 Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2005 CGNS05-proc inproceedings On the Approximability of Network Design Problems 943--951 2005 Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2005 CGNS05 article ACM Trans. Algorithms MR2419120 On the approximability of some network design problems 1549-6325 Art. 23, 17 4 ACM Transactions on Algorithms 2 2008 68W05 (05C85 68M10 68R10 68W25 90B10) 2008 CGR05-proc inproceedings Improved Approximations for {Sparsest} {Cut} 102--111 2005 Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2005 CGR05 article ACM Trans. Algorithms MR2419119 Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut 1549-6325 Art. 22, 18 4 ACM Transactions on Algorithms 2 2008 68R10 (54E35) 2008 BDGRRRS05 inproceedings Approximation Algorithms for Embeddings Into Low-Dimensional Spaces 119--128 2005 Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2005 GuptaPal05 inproceedings Lecture Notes in Computer Science Stochastic {Steiner} Trees Without a Root 1051-1063 3580 2005 Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP) http://dx.doi.org/10.1007/11523468_85 2005 GuptaMOR05 inproceedings Quorum placement in networks to minimize access delays 87-96 2005 Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC) http://doi.acm.org/10.1145/1073829 2005 GuptaPRSwed05 inproceedings Lecture Notes in Computer Science What About {Wednesday}? Approximation Algorithms for Multistage Stochastic Optimization 86-98 3624 2005 Proceedings of the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) http://dx.doi.org/10.1007/11538462_8 2005 GKwinner05 inproceedings Lecture Notes in Computer Science Where's the Winner? Max-Finding and Sorting with Metric Costs 74-85 3624 2005 Proceedings of the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) http://dx.doi.org/10.1007/11538462_7 2005 ABCDGKNS05 inproceedings Metric Embeddings with Relaxed Guarantees 83-100 2005 Proceedings of the 46th Symposium on the Foundations of Computer Science (FOCS) http://dx.doi.org/10.1109/SFCS.2005.51 2005 CDGKS09 article SIAM Journal on Computing Metric Embeddings with Relaxed Guarantees metric embeddings; low-distortion embeddings; metric spaces; metric decompositions; randomized algorithms 2303-2329 38 6 2009 10.1137/060670511 2009 ChanG06-proc inproceedings Small hop-diameter sparse spanners for doubling metrics 70-78 2006 Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA) http://doi.acm.org/10.1145/1109557.1109566 2006 ChanG06 article Discrete {\&} Computational Geometry Small Hop-diameter Sparse Spanners for Doubling Metrics 28-44 41 2009 1 http://dx.doi.org/10.1007/s00454-008-9115-5 2009 GHR06 inproceedings Oblivious network design 970-979 2006 Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA) http://doi.acm.org/10.1145/1109557.1109665 2006 DGR06 inproceedings Improved embeddings of graph metrics into random trees 61-69 2006 Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA) http://doi.acm.org/10.1145/1109557.1109565 2006 GT06 inproceedings Approximating unique games 99-106 2006 Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA) http://doi.acm.org/10.1145/1109557.1109569 2006 GGMOR06 inproceedings Quorum placement in networks: minimizing network congestion 16-25 2006 Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing (PODC) http://doi.acm.org/10.1145/1146381.1146388 2006 KrauseGGK06 inproceedings Near-optimal sensor placements: maximizing information while minimizing communication cost 2-10 2006 Proceedings of the 5th International Conference on Information Processing in Sensor Networks http://doi.acm.org/10.1145/1127777.1127782 2006 ChanDG06 inproceedings Spanners with Slack 196-207 2006 Proceedings of the 14th Annual European Symposium on Algorithms (ESA) http://dx.doi.org/10.1007/11841036_20 2006 GKLRS07 inproceedings An Efficient Cost-Sharing Mechanism for the Prize-Collecting Steiner Forest Problem 1153--1162 2007 Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA) http://doi.acm.org/10.1145/1109557.1109569 2007 AG07 inproceedings Infrastructure Leasing Problems 424--438 Proceedings of the 12th Integer Programming and Combinatorial Optimization Conference (IPCO) 2007 http://dx.doi.org/10.1007/978-3-540-72792-7_32 2007 GGLR07 inproceedings Pricing Tree Access Networks with Connected Backbones 498--509 Proceedings of the 15th Annual European Symposium on Algorithms (ESA) 2007 http://dx.doi.org/10.1007/978-3-540-75520-3_45 2007 GHNR07 inproceedings Dial a Ride from $k$-Forest 241--252 Proceedings of the 15th Annual European Symposium on Algorithms (ESA) 2007 http://dx.doi.org/10.1007/978-3-540-75520-3_23 2007 GHK07 inproceedings Stochastic {S}teiner Tree with Non-Uniform Inflation 134--148 Proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) 2007 http://dx.doi.org/10.1007/978-3-540-74208-1_10 2007 BGGKR01-tr techreport On Configuring {BGP} Route Reflectors 2001 Bell Labs 2001 BGGKR07 inproceedings On Configuring {BGP} Route Reflectors 2007 Proceedings of the 2nd International Conference on COMmunication System softWAre and MiddlewaRE (COMSWARE) http://dx.doi.org/10.1109/COMSWA.2007.382444 2007 BBGN07 inproceedings An {$O(\log^2 k)$}-Competitive Algorithm for Metric Bipartite Matching 522-533 2007 Proceedings of the 15th Annual European Symposium on Algorithms (ESA) http://dx.doi.org/10.1007/978-3-540-75520-3_47 2007 KMGG07 inproceedings Selecting Observations under Multiple Objectives to appear 2007 Advances in Neural Information Processing Systems 20 2007 GGKT07-old unpublished All $L_p$ Norms Approximations 2007 manuscript 2007 GGKT08 inproceedings Dagstuhl Seminar Proceedings All-Norms and All-$L_p$-Norms Approximation Algorithms 08004 2008 Proceedings of the Foundations of Software Technology and Theoretical Computer Science (FST\&TCS) http://drops.dagstuhl.de/opus/volltexte/2008/1753/ 2008 GGLS08 inproceedings Stochastic analyses for online combinatorial optimization problems 942--951 2008 Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2008 CG08 inproceedings Approximating {TSP} on metrics with bounded global growth 690--699 2008 Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2008 CGT08 inproceedings Ultra-low-dimensional embeddings for doubling metrics 333--342 2008 Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2008 CEGS08 inproceedings Set connectivity problems in undirected graphs and the directed {S}teiner network problem 532--541 2008 Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2008 AGGN08 inproceedings A plant location guide for the unsure 1164--1173 2008 Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2008 BJG08 article IEEE/ACM Trans. Comput. Biol. Bioinformatics Extracting Dynamics from Static Cancer Expression Data 1545-5963 Los Alamitos, CA, USA 172--182 5 2008 2 http://dx.doi.org/10.1109/TCBB.2007.70233 IEEE Computer Society Press 2008 GuptaT08 inproceedings How to Complete a Doubling Metric 36-47 2008 Proceedings of the 8th Latin American Symposium on Theoretical Informatics http://dx.doi.org/10.1007/978-3-540-78773-0_4 2008 GGLMSS08 article Foundations of Computer Science, 2008. FOCS '08. IEEE 49th Annual IEEE Symposium on Set Covering with our Eyes Closed computational complexity graph theory optimisation set theory stochastic processesa-priori optimization disc-covering problem stochastic online algorithm universal multicut problem universal set cover problem 0272-5428 347-356 Oct. 2008 http://dx.doi.org/10.1109/FOCS.2008.31 2008-10 bdgit-soda09 inproceedings Secretary problems: weights and discounts 1245--1254 2009 Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA) http://doi.acm.org/10.1145/1496770.1496905 2009 BBG09 inproceedings Approximate clustering without the approximation 1068-1077 2009 Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA) http://doi.acm.org/10.1145/1496770.1496886 2009 GT-arxiv article CoRR Simpler Analyses of Local Search Algorithms for Facility Location DBLP, http://dblp.uni-trier.de abs/0809.2554 2008 http://arxiv.org/abs/0809.2554 2008 GHNR-arxiv article CoRR Dial a Ride from k-forest DBLP, http://dblp.uni-trier.de abs/0707.0648 2007 http://arxiv.org/abs/0707.0648 2007 GTalwar-convexify article CoRR How to Complete a Doubling Metric DBLP, http://dblp.uni-trier.de abs/0712.3331 2007 http://arxiv.org/abs/0712.3331 2007 BreitbartGGKR07 inproceedings On Configuring BGP Route Reflectors DBLP, http://dblp.uni-trier.de 2007 Proceedings of the Second International Conference on COMmunication System softWAre and MiddlewaRE (COMSWAREi) http://dx.doi.org/10.1109/COMSWA.2007.382444 2007 GK-ssf09 inproceedings A constant-factor approximation for stochastic Steiner forest New York, NY, USA Bethesda, MD, USA 659--668 978-1-60558-506-2 2009 STOC '09: Proceedings of the 41st annual ACM symposium on Symposium on theory of computing http://doi.acm.org/10.1145/1536414.1536504 ACM 2009 GKR-online09 inproceedings Online and stochastic survivable network design New York, NY, USA Bethesda, MD, USA 685--694 978-1-60558-506-2 2009 STOC '09: Proceedings of the 41st annual ACM symposium on Symposium on theory of computing http://doi.acm.org/10.1145/1536414.1536507 ACM 2009 GLMRT-arxiv article CoRR Differentially Private Approximation Algorithms http://arxiv.org/abs/0903.4510 abs/0903.4510 2009 2009 Krauthgamer, Robert Krauthgamer Robert Krauthgamer Bartal, Yair Bartal Yair Bartal Neiman, Ofer Neiman Ofer Neiman Raskhodnikova, Sofya Raskhodnikova Sofya Raskhodnikova Nagarajan, Viswanath Nagarajan Viswanath Nagarajan Naor, Joseph (Seffi) Naor Joseph (Seffi) Naor Chuzhoy, Julia Chuzhoy Chuzhoy, Julia Sidiropoulos, Anastasios Sidiropoulos Anastasios Sidiropoulos Bansal, Nikhil Bansal Nikhil Bansal Deza, Michel Marie Deza Michel Marie Deza Guestrin, Carlos Guestrin Carlos Guestrin Roth, Aaron Roth Aaron Roth Grandoni, Fabrizio Grandoni Grandoni, Fabrizio Indyk, Piotr Indyk Piotr Indyk Zhou, Shuheng Zhou Shuheng Zhou Ligett, Katrina Ligett Katrina Ligett Chan, T.-H. Hubert Chan T.-H. Hubert Chan Sch\"{a}fer, Guido Sch\"{a}fer Guido Sch\"{a}fer Kumar, Amit Kumar Kumar, Amit Garg, Naveen Garg Naveen Garg Rastogi, Rajeev Rastogi Rajeev Rastogi Babaioff, Moshe Babaioff Babaioff, Moshe Yener, B{\"u}lent Yener B{\"u}lent Yener P{\'a}l, Martin P{\'a}l Martin P{\'a}l McSherry, Frank McSherry Frank McSherry Gupta, Anupam Gupta Anupam Gupta Dhamdhere, Kedar Dhamdhere Kedar Dhamdhere Talwar, Kunal Talwar Kunal Talwar Rabinovich, Yuri Rabinovich Yuri Rabinovich Raz, Danny Raz Raz, Danny Hajiaghayi, MohammadTaghi Hajiaghayi MohammadTaghi Hajiaghayi Tardos, {\'E}va Tardos {\'E}va Tardos R{\"a}cke, Harald R{\"a}cke Harald R{\"a}cke B\u{a}doiu, Mihai B\u{a}doiu Mihai B\u{a}doiu Sankowski, Piotr Sankowski Sankowski, Piotr Chawla, Shuchi Chawla Chawla, Shuchi Krishnaswamy, Ravishankar Krishnaswamy Krishnaswamy, Ravishankar Chekuri, Chandra Chekuri Chandra Chekuri Ravi, R. Ravi Ravi, R. Naor, Joseph Naor Joseph Naor Miettinen, Pauli Miettinen Miettinen, Pauli Slivkins, Aleksandrs Slivkins Aleksandrs Slivkins Reiter, Michael K. Reiter Michael K. Reiter Segev, Danny Segev Danny Segev Newman, Ilan Newman Newman, Ilan Immorlica, Nicole Immorlica Immorlica, Nicole Oprea, Florian Oprea Florian Oprea Singh, Mohit Singh Singh, Mohit Even, Guy Even Guy Even Balcan, Maria-Florina Balcan Maria-Florina Balcan Leonardi, Stefano Leonardi Leonardi, Stefano Anthony, Barbara M. Anthony Barbara M. Anthony Goyal, Vineet Goyal Vineet Goyal Lee, James R.\ Lee James R.\ Lee Srinivasan, Aravind Srinivasan Aravind Srinivasan Roughgarden, Tim Roughgarden Roughgarden, Tim Sinha, Amitabh Sinha Amitabh Sinha Breitbart, Yuri Breitbart Yuri Breitbart Dasgupta, Sanjoy Dasgupta Sanjoy Dasgupta MacMahan, Brendan MacMahan Brendan MacMahan Zane, Francis X. Zane Francis X. Zane Blum, Avrim Blum Avrim Blum Krause, Andreas Krause Andreas Krause Thorup, Mikkel Thorup Mikkel Thorup Andoni, Alexandr Andoni Alexandr Andoni Buchbinder, Niv Buchbinder Niv Buchbinder K\"{o}nemann, Jochen K\"{o}nemann Jochen K\"{o}nemann Sinclair, Alistair Sinclair Sinclair, Alistair Abraham, Ittai Abraham Ittai Abraham Maggs, Bruce M. Maggs Bruce M. Maggs Bar-Joseph, Ziv Bar-Joseph Bar-Joseph, Ziv Kleinberg, Jon M. Kleinberg Jon M. Kleinberg Golovin, Daniel Golovin Daniel Golovin Dinitz, Michael Dinitz Dinitz, Michael Garofalakis, Minos N. Garofalakis Minos N. Garofalakis Chakrabarti, Amit Chakrabarti Amit Chakrabarti Tangwongsan, Kanat Tangwongsan Kanat Tangwongsan
(
)
(
)
.
.
,
(
)
,
.
,
(
)
,
.
:
Categories:
Keywords:
[
link
]
[
doi
]
Anupam Gupta's Publications