Search results for "k-median problem"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	DongMei Xing	Nonmetric Multicommodity Facility Location and K-Median Problem with Service Installation Costs.	CSSE	2008	DBLP DOI BibTeX RDF
2	Chaitanya Swamy, David B. Shmoys	Fault-tolerant facility location.	ACM Transactions on Algorithms	2008	DBLP DOI BibTeX RDF	Approximation algorithms, facility location, k-median problem
2	Sven de Vries, Marc E. Posner, Rakesh V. Vohra	Polyhedral Properties of the K -median Problem on a Tree.	Math. Program.	2007	DBLP DOI BibTeX RDF	Polyhedral description, Lifting, Facets, Valid inequalities
2	Amit Kumar, Yogish Sabharwal	The Priority k-Median Problem.	FSTTCS	2007	DBLP DOI BibTeX RDF
2	Marek Chrobak, Claire Kenyon, Neal E. Young	The Reverse Greedy Algorithm for the Metric K-Median Problem.	COCOON	2005	DBLP DOI BibTeX RDF	approximation algorithms, online algorithms, Analysis of algorithms
2	Aaron Archer, Ranjithkumar Rajagopalan, David B. Shmoys	Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties.	ESA	2003	DBLP DOI BibTeX RDF
2	Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter	The k-Median Problem for Directed Trees.	MFCS	2001	DBLP DOI BibTeX RDF
2	John D. Kececioglu, Jun Ju	Separtating repeats in DNA sequence assembly.	RECOMB	2001	DBLP DOI BibTeX RDF	disambiguating repeats, shotgun sequencing, computational biology, k-median problem
2	Kamal Jain, Vijay V. Vazirani	Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation.	J. ACM	2001	DBLP DOI BibTeX RDF	approximation algorithms, linear programming, Lagrangian relaxation, facility location problem, k-median problem
1	Marcel R. Ackermann	Algorithms for the Bregman k-Median problem.		2009	RDF
1	Marcel R. Ackermann, Johannes Blömer	Coresets and approximate clustering for Bregman divergences.	SODA	2009	DBLP DOI BibTeX RDF
1	Marcel R. Ackermann, Johannes Blömer, Christian Sohler	Clustering for metric and non-metric distance measures.	SODA	2008	DBLP DOI BibTeX RDF
1	Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan	A plant location guide for the unsure.	SODA	2008	DBLP DOI BibTeX RDF
1	Zachary Friggstad, Mohammad R. Salavatipour	Minimizing Movement in Mobile Facility Location Problems.	FOCS	2008	DBLP DOI BibTeX RDF
1	Joshua Robinson, Mustafa Uysal, Ram Swaminathan, Edward W. Knightly	Adding Capacity Points to a Wireless Mesh Network Using Local Search.	INFOCOM	2008	DBLP DOI BibTeX RDF
1	Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young	Incremental Medians via Online Bidding.	Algorithmica	2008	DBLP DOI BibTeX RDF
1	Stavros G. Kolliopoulos, Satish Rao	A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem.	SIAM J. Comput.	2007	DBLP DOI BibTeX RDF
1	Rajgopal Kannan, Shuangqing Wei, Vasu Chakravarthy, Murali Rangaswamy	A Fully Polynomial Approximation Algorithm for Collaborative Relaying in Sensor Networks Under Finite Rate Constraints.	DCOSS	2007	DBLP DOI BibTeX RDF
1	Marek Chrobak, Mathilde Hurand	Better Bounds for Incremental Medians.	WAOA	2007	DBLP DOI BibTeX RDF	Incremental medians, approximation algorithm, online algorithm, analysis of algorithms
1	Marek Chrobak, Claire Kenyon, Neal E. Young	The reverse greedy algorithm for the metric k-median problem.	Inf. Process. Lett.	2006	DBLP DOI BibTeX RDF
1	Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko	Tight approximation algorithms for maximum general assignment problems.	SODA	2006	DBLP DOI BibTeX RDF
1	Guolong Lin, Chandrashekhar Nagarajan, Rajmohan Rajaraman, David P. Williamson	A general approach for incremental approximation and hierarchical clustering.	SODA	2006	DBLP DOI BibTeX RDF
1	Marek Chrobak, Claire Kenyon, Neal E. Young	The reverse greedy algorithm for the metric k-median problem	CoRR	2005	DBLP BibTeX RDF
1	Julia Chuzhoy, Yuval Rabani	Approximating k-median with non-uniform capacities.	SODA	2005	DBLP DOI BibTeX RDF
1	Mingjun Song, Sanguthevar Rajasekaran	Fast k-Means Algorithms with Constant Approximation.	ISAAC	2005	DBLP DOI BibTeX RDF
1	Chaitanya Swamy, Amit Kumar	Primal-Dual Algorithms for Connected Facility Location Problems.	Algorithmica	2004	DBLP DOI BibTeX RDF	Approximation algorithms, Steiner trees, Facility location, Primal-dual algorithms, Connected facility location
1	Ramgopal R. Mettu, C. Greg Plaxton	Optimal Time Bounds for Approximate Clustering.	Machine Learning	2004	DBLP DOI BibTeX RDF	discrete location theory, approximation algorithms, k-means, unsupervised clustering, k-median
1	Adam Meyerson, Liadan O'Callaghan, Serge A. Plotkin	A k-Median Algorithm with Running Time Independent of Data Size.	Machine Learning	2004	DBLP DOI BibTeX RDF	sublinear, clustering, sampling
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	Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani	Approximation schemes for clustering problems.	STOC	2003	DBLP DOI BibTeX RDF
1	Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter	Faster Algorithms for k-Medians in Trees.	MFCS	2003	DBLP DOI BibTeX RDF
1	Inge Li Gørtz, Anthony Wirth	Asymmetry in k-Center Variants.	RANDOM-APPROX	2003	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	Kamal Jain, Mohammad Mahdian, Amin Saberi	A new greedy approach for facility location problems.	STOC	2002	DBLP DOI BibTeX RDF
1	Rafail Ostrovsky, Yuval Rabani	Polynomial-time approximation schemes for geometric min-sum median clustering.	J. ACM	2002	DBLP DOI BibTeX RDF	Clustering, high-dimensional data, polynomial-time approximation schemes
1	Adrian Vetta	Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions.	FOCS	2002	DBLP DOI BibTeX RDF
1	Chaitanya Swamy, Amit Kumar	Primal-Dual Algorithms for Connected Facility Location Problems.	APPROX	2002	DBLP DOI BibTeX RDF
1	Sudipto Guha, Nina Mishra, Rajeev Motwani, Liadan O'Callaghan	Clustering Data Streams.	FOCS	2000	DBLP DOI BibTeX RDF	data stream clustering, point sequence, data stream model, Web click stream analysis, multimedia data analysis, constant-factor approximation algorithms, computational complexity, data analysis, deterministic algorithms, deterministic algorithms, very large databases, massive data sets, pattern clustering, k-median problem
1	Ramgopal R. Mettu, C. Greg Plaxton	The Online Median Problem.	FOCS	2000	DBLP DOI BibTeX RDF	online median problem, linear-time constant-competitive algorithm, linear-time constant-factor approximation algorithm, primal-dual-based facility location algorithm, facility location, heuristic programming, competitive ratio, approximation theory, k-median problem, worst-case ratio
1	Rafail Ostrovsky, Yuval Rabani	Polynomial Time Approximation Schemes for Geometric k-Clustering.	FOCS	2000	DBLP DOI BibTeX RDF	geometric k-clustering, data point clustering, data set partitioning, high dimensional geometry, binary cube, computational complexity, computational geometry, Hamming distance, NP-hard problem, distance function, polynomial time approximation schemes, pattern clustering, k-median problem
1	Dominique Peeters, Isabelle Thomas	Distance predicting functions and applied location-allocation models..	Journal of Geographical Systems	2000	DBLP DOI BibTeX RDF
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
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	Kamal Jain, Vijay V. Vazirani	Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems.	FOCS	1999	DBLP DOI BibTeX RDF	approximation algorithms, linear programming, facility location, k-median
1	Piotr Krysta, Roberto Solis-Oba	Approximation Algorithms for Bounded Facility Location.	COCOON	1999	DBLP DOI BibTeX RDF
1	Stavros G. Kolliopoulos, Satish Rao	A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem.	ESA	1999	DBLP DOI BibTeX RDF