| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Aditya Bhaskara, Moses Charikar, Aravindan Vijayaraghavan, Venkatesan Guruswami, Yuan Zhou |
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph.  |
SODA  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Johan Håstad, Rajsekar Manokaran, Prasad Raghavendra, Moses Charikar |
Beating the Random Ordering is Hard: Every ordering CSP is approximation resistant.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff |
Improved Approximation Algorithms for Label Cover Problems.  |
Algorithmica  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Aditya Bhaskara, Moses Charikar, Rajsekar Manokaran, Aravindan Vijayaraghavan |
On Quadratic Programming with a Ratio Objective  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Aditya Bhaskara, Moses Charikar, Venkatesan Guruswami, Aravindan Vijayaraghavan, Yuan Zhou |
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Nir Ailon, Moses Charikar |
Fitting Tree Metrics: Hierarchical Clustering and Phylogeny.  |
SIAM J. Comput.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Johan Håstad, Rajsekar Manokaran, Prasad Raghavendra, Moses Charikar |
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant.  |
SIAM J. Comput.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Alantha Newman, Aleksandar Nikolov |
Tight Hardness Results for Minimizing Discrepancy.  |
SODA  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Wei Dong, Moses Charikar, Kai Li |
Efficient k-nearest neighbor graph construction for generic similarity measures.  |
WWW  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr Andoni, Moses Charikar, Ofer Neiman, Huy L. Nguyen |
Near Linear Lower Bound for Dimension Reduction in L1.  |
FOCS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao |
l22 Spreading Metrics for Vertex Ordering Problems.  |
Algorithmica  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan |
Detecting High Log-Densities -- an O(n^1/4) Approximation for Densest k-Subgraph  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Prahladh Harsha, Moses Charikar, Matthew Andrews, Sanjeev Arora, Subhash Khot, Dana Moshkovitz, Lisa Zhang, Ashkan Aazami, Dev Desai, Igor Gorodezky, Geetha Jagannathan, Alexander S. Kulikov, Darakhshan J. Mir, Alantha Newman, Aleksandar Nikolov, David Pritchard, Gwen Spencer |
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Moses Charikar, Tom Leighton, Shi Li, Ankur Moitra |
Vertex Sparsifiers and Abstract Rounding Algorithms  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
Local Global Tradeoffs in Metric Embeddings.  |
SIAM J. Comput.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar (eds.) |
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010  |
SODA  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Moses Charikar, Tom Leighton, Shi Li, Ankur Moitra |
Vertex Sparsifiers and Abstract Rounding Algorithms.  |
FOCS  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan |
Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph.  |
STOC  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
Near-optimal algorithms for maximum constraint satisfaction problems.  |
ACM Transactions on Algorithms  |
2009 |
DBLP DOI BibTeX RDF |
MAX 2CSP, MAX k-CSP, SDP |
| 1 | Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff |
Improved Approximation Algorithms for Label Cover Problems.  |
ESA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Venkatesan Guruswami, Rajsekar Manokaran |
Every Permutation CSP of arity 3 is Approximation Resistant.  |
IEEE Conference on Computational Complexity  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
Integrality gaps for Sherali-Adams relaxations.  |
STOC  |
2009 |
DBLP DOI BibTeX RDF |
Sherali-Adams hierarchy, lift-and-project methods, local-global metric spaces |
| 1 | MohammadHossein Bateni, Moses Charikar, Venkatesan Guruswami |
MaxMin allocation via degree lower-bounded arborescences.  |
STOC  |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, linear programming, graphs, lift-and-project |
| 1 | Nir Ailon, Moses Charikar, Alantha Newman |
Aggregating inconsistent information: Ranking and clustering.  |
J. ACM  |
2008 |
DBLP DOI BibTeX RDF |
minimum feedback arc-set, Rank aggregation, tournaments, consensus clustering, correlation clustering |
| 1 | Moses Charikar, Howard J. Karloff, Claire Mathieu, Joseph Naor, Michael E. Saks |
Online multicast with egalitarian cost sharing.  |
SPAA  |
2008 |
DBLP DOI BibTeX RDF |
best response, nash equilibrium, price of anarchy, shapley value |
| 1 | Wei Dong, Moses Charikar, Kai Li |
Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces.  |
SIGIR  |
2008 |
DBLP DOI BibTeX RDF |
asymmetric distance estimation, sketch, similarity search |
| 1 | Wei Dong, Zhe Wang, Moses Charikar, Kai Li |
Efficiently matching sets of features with random histograms.  |
ACM Multimedia  |
2008 |
DBLP DOI BibTeX RDF |
random histogram, set of features, locality sensitive hashing |
| 1 | Wei Dong, Zhe Wang, William Josephson, Moses Charikar, Kai Li |
Modeling LSH for performance tuning.  |
CIKM  |
2008 |
DBLP DOI BibTeX RDF |
similarity search, locality sensitive hashing |
| 1 | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
Local Global Tradeoffs in Metric Embeddings.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
On the Advantage over Random for Maximum Acyclic Subgraph.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
A divide and conquer algorithm for d-dimensional arrangement.  |
SODA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
Near-optimal algorithms for maximum constraint satisfaction problems.  |
SODA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Qin Lv, William Josephson, Zhe Wang, Moses Charikar, Kai Li |
Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search .  |
VLDB  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Moses Charikar, Klaus Jansen, Omer Reingold, José D. P. Rolim (eds.) |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings  |
APPROX-RANDOM  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
Local Global Tradeoffs in Metric Embeddings.  |
FOCS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
On the Advantage over Random for Maximum Acyclic Subgraph.  |
FOCS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Agarwal, Noga Alon, Moses Charikar |
Improved approximation for directed cut problems.  |
STOC  |
2007 |
DBLP DOI BibTeX RDF |
directed multicut, directed sparsest cut, approximation algorithm, linear programming relaxation |
| 1 | Zhe Wang, Wei Dong, William Josephson, Qin Lv, Moses Charikar, Kai Li |
Sizing sketches: a rank-based analysis for similarity search.  |
SIGMETRICS  |
2007 |
DBLP DOI BibTeX RDF |
feature-rich data, sketch, similarity search |
| 1 | Zhe Wang, William K. Josephson, Qin Lv, Moses Charikar, Kai Li |
Filtering Image Spam with Near-Duplicate Detection.  |
CEAS  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
Approximation Algorithm for the Max k-CSP Problem.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
Note on MAX 2SAT.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Moses Charikar, Robert Krauthgamer |
Embedding the Ulam metric into l1.  |
Theory of Computing  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Michel X. Goemans, Howard J. Karloff |
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem.  |
Math. Oper. Res.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar |
Guest editor's foreword.  |
J. Comput. Syst. Sci.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao |
l22 spreading metrics for vertex ordering problems.  |
SODA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Samir Khuller |
A robust maximum completion time measure for scheduling.  |
SODA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
Directed metrics and directed graph partitioning problems.  |
SODA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Qin Lv, William Josephson, Zhe Wang, Moses Charikar, Kai Li |
Efficient filtering with sketches in the ferret toolkit.  |
Multimedia Information Retrieval  |
2006 |
DBLP DOI BibTeX RDF |
feature-rich data, filtering, sketch, similarity search, toolkit |
| 1 | Qin Lv, William Josephson, Zhe Wang, Moses Charikar, Kai Li |
Ferret: a toolkit for content-based similarity search of feature-rich data.  |
EuroSys  |
2006 |
DBLP DOI BibTeX RDF |
feature-rich data, sketch, similarity search, toolkit |
| 1 | Moses Charikar, Konstantin Makarychev, Yury Makarychev |
Near-optimal algorithms for unique games.  |
STOC  |
2006 |
DBLP DOI BibTeX RDF |
unique games, approximation algorithms, semidefinite programming, constraint satisfaction problems |
| 1 | Bo Brinkman, Moses Charikar |
On the impossibility of dimension reduction in l1.  |
J. ACM  |
2005 |
DBLP DOI BibTeX RDF |
embedding, Metric spaces, dimension reduction |
| 1 | Moses Charikar, Venkatesan Guruswami, Anthony Wirth |
Clustering with qualitative information.  |
J. Comput. Syst. Sci.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Sudipto Guha |
Improved Combinatorial Algorithms for Facility Location Problems.  |
SIAM J. Comput.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, Amit Sahai, Abhi Shelat |
The smallest grammar problem.  |
IEEE Transactions on Information Theory  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Moses Charikar, Sanjeev Khanna, Joseph Naor |
Approximating the average response time in broadcast scheduling.  |
SODA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Adriana Karagiozova |
A tight threshold for metric Ramsey phenomena.  |
SODA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Chandra Chekuri, Martin Pál |
Sampling Bounds for Stochastic Optimization.  |
APPROX-RANDOM  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nir Ailon, Moses Charikar |
Fitting tree metrics: Hierarchical clustering and Phylogeny.  |
FOCS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Adriana Karagiozova |
On non-uniform multicommodity buy-at-bulk network design.  |
STOC  |
2005 |
DBLP DOI BibTeX RDF |
buy-at-bulk, multicommodity, approximation algorithms, network design, non-uniform |
| 1 | Nir Ailon, Moses Charikar, Alantha Newman |
Aggregating inconsistent information: ranking and clustering.  |
STOC  |
2005 |
DBLP DOI BibTeX RDF |
minimum feedback arc set, rank aggregation, tournament, consensus clustering, correlation clustering |
| 1 | Amit Agarwal, Moses Charikar, Konstantin Makarychev, Yury Makarychev |
O(sqrt(log n)) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems.  |
STOC  |
2005 |
DBLP DOI BibTeX RDF |
directed balanced separator, directed sparsest cut, min 2CNF deletion, min UnCut, min multicut |
| 1 | Moses Charikar, Kevin Chen, Martin Farach-Colton |
Finding frequent items in data streams.  |
Theor. Comput. Sci.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Joseph Naor, Baruch Schieber |
Resource optimization in QoS multicast routing of real-time multimedia.  |
IEEE/ACM Trans. Netw.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Jon M. Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins |
Minimizing Wirelength in Zero and Bounded Skew Clock Trees.  |
SIAM J. Discrete Math.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Rina Panigrahy |
Clustering to minimize the sum of cluster diameters.  |
J. Comput. Syst. Sci.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani |
Incremental Clustering and Dynamic Information Retrieval.  |
SIAM J. Comput.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Michel X. Goemans, Howard J. Karloff |
On the Integrality Ratio for Asymmetric TSP.  |
FOCS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Anthony Wirth |
Maximizing Quadratic Programs: Extending Grothendieck's Inequality.  |
FOCS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Qin Lv, Moses Charikar, Kai Li |
Image similarity search with compact data structures.  |
CIKM  |
2004 |
DBLP DOI BibTeX RDF |
search, image similarity, compact data structures |
| 1 | Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher |
A derandomization using min-wise independent permutations.  |
J. Discrete Algorithms  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Bo Brinkman, Moses Charikar |
On the Impossibility of Dimension Reduction in l1.  |
FOCS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Venkatesan Guruswami, Anthony Wirth |
Clustering with Qualitative Information.  |
FOCS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Liadan O'Callaghan, Rina Panigrahy |
Better streaming algorithms for clustering problems.  |
STOC  |
2003 |
DBLP DOI BibTeX RDF |
clustering, streaming algorithm, k-median |
| 1 | Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai |
Query Strategies for Priced Information.  |
J. Comput. Syst. Sci.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys |
A Constant-Factor Approximation Algorithm for the k-Median Problem.  |
J. Comput. Syst. Sci.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar |
On semidefinite programming relaxations for graph coloring and vertex cover.  |
SODA  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Piotr Indyk, Rina Panigrahy |
New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems.  |
ICALP  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Kevin Chen, Martin Farach-Colton |
Finding Frequent Items in Data Streams.  |
ICALP  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Amit Sahai |
Dimension Reduction in the \ell _1 Norm.  |
FOCS  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar |
Similarity estimation techniques from rounding algorithms.  |
STOC  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, April Rasala, Amit Sahai, Abhi Shelat |
Approximating the smallest grammar: Kolmogorov complexity in natural models.  |
STOC  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Bartal, Moses Charikar, Piotr Indyk |
On page migration and other relaxed task systems.  |
Theor. Comput. Sci.  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Susanne Albers, Moses Charikar, Michael Mitzenmacher |
Delayed Information and Action in On-Line Algorithms.  |
Inf. Comput.  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Samir Khuller, Balaji Raghavachari |
Algorithms for Capacitated Vehicle Routing.  |
SIAM J. Comput.  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan |
Algorithms for facility location problems with outliers.  |
SODA  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Bartal, Moses Charikar, Danny Raz |
Approximating min-sum k-clustering in metric spaces.  |
STOC  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Rina Panigrahy |
Clustering to minimize the sum of cluster diameters.  |
STOC  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Moses Charikar, Marek Karpinski |
On-Line Load Balancing for Related Machines  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2000 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Moses Charikar, Marek Karpinski |
On-Line Load Balancing for Related Machines.  |
J. Algorithms  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei Z. Broder, Moses Charikar, Alan M. Frieze, Michael Mitzenmacher |
Min-Wise Independent Permutations.  |
J. Comput. Syst. Sci.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Rohit Negi, Moses Charikar, John M. Cioffi |
Minimum Outage Transmission over Fading Channels with Delay Constraint.  |
ICC  |
2000 |
DBLP BibTeX RDF |
|
| 1 | Moses Charikar, Joseph Naor, Baruch Schieber |
Resource Optimization in QoS Multicast Routing of Real-Time Multimedia.  |
INFOCOM  |
2000 |
DBLP BibTeX RDF |
|
| 1 | Moses Charikar |
Greedy approximation algorithms for finding dense components in a graph.  |
APPROX  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Venkatesan Guruswami, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai |
Combinatorial feature selection problems.  |
FOCS  |
2000 |
DBLP DOI BibTeX RDF |
combinatorial feature selection problems, multidimensional objects, subset size maximization, subset size minimization, p-center problem, hardness results, information retrieval, information retrieval, computational complexity, approximation algorithms, feature extraction, optimisation, set theory, VC-dimension, combinatorial mathematics, Vapnik-Chervonenkis dimension |
| 1 | Moses Charikar, Surajit Chaudhuri, Rajeev Motwani, Vivek R. Narasayya |
Towards Estimation Error Guarantees for Distinct Values.  |
PODS  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai |
Query strategies for priced information (extended abstract).  |
STOC  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li |
Approximation Algorithms for Directed Steiner Problems.  |
J. Algorithms  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Jon M. Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins |
Minimizing Wirelength in Zero and Bounded Skew Clock Trees.  |
SODA  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Sudipto Guha |
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems.  |
FOCS  |
1999 |
DBLP DOI BibTeX RDF |
linear programming, approximation, local search, facility location, combinatorial algorithms, k-median |
| 1 | Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys |
A Constant-Factor Approximation Algorithm for the k-Median Problem (Extended Abstract).  |
STOC  |
1999 |
DBLP DOI BibTeX RDF |
|