SODA 2012 - PDF Preprint Papers

SODA 2012 Symposium on Discrete Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SODA-2012 Paper

click to vote

SODA
2012
ACM

297views Algorithms» more SODA 2012»

Constant factor approximation algorithm for the knapsack median problem

11 years 7 months ago

Download www.cse.iitd.ernet.in

We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...

Amit Kumar

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	297	Constant factor approximation algorithm for the knapsack median problem	claim
2	278	Beyond myopic best response (in Cournot competition)	claim
3	268	Analyzing graph structure via linear measurements	claim
4	262	A polynomial-time approximation scheme for planar multiway cut	claim
5	253	Kernelization of packing problems	claim
6	249	Improved competitive ratio for the matroid secretary problem	claim
7	245	Lower bounds for number-in-hand multiparty communication complexity, made easy	claim
8	245	Sketching valuation functions	claim
9	243	Bidimensionality and geometric graphs	claim
10	240	Simultaneous approximations for adversarial and stochastic online budgeted allocation	claim
11	240	Constructing high order elements through subspace polynomials	claim
12	235	Fast zeta transforms for lattices with few irreducibles	claim
13	229	Approximation algorithms for stochastic orienteering	claim
14	227	Improved output-sensitive quantum algorithms for Boolean matrix multiplication	claim
15	226	On the hardness of pricing loss-leaders	claim
16	225	Approximating rooted Steiner networks	claim
17	224	Algorithms for the transportation problem in geometric settings	claim
18	223	Data reduction for weighted and outlier-resistant clustering	claim
19	218	Linear kernels for (connected) dominating set on H-minor-free graphs	claim
20	217	Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms	claim
21	217	Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph	claim
22	213	Expanders are universal for the class of all spanning trees	claim
23	212	Parallelism and time in hierarchical self-assembly	claim
24	210	Approximation algorithms and hardness of the k-route cut problem	claim
25	209	Simple and practical algorithm for sparse Fourier transform	claim
26	208	Partial match queries in random quadtrees	claim
27	206	LSH-preserving functions and their applications	claim
28	205	Approximate duality of multicommodity multiroute flows and cuts: single source case	claim
29	205	Global minimum cuts in surface embedded graphs	claim
30	203	Black-box reductions for cost-sharing mechanism design	claim
31	200	Optimal crowdsourcing contests	claim
32	200	The shifting sands algorithm	claim
33	199	On the communication and streaming complexity of maximum bipartite matching	claim
34	196	Polytope approximation and the Mahler volume	claim
35	195	Concentration and moment inequalities for polynomials of independent random variables	claim
36	191	Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications	claim
37	185	Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling	claim
38	185	On a linear program for minimum-weight triangulation	claim
39	183	Information dissemination via random walks in d-dimensional space	claim
40	177	Stochastic coalescence in logarithmic time	claim
41	174	Using hashing to solve the dictionary problem	claim
42	173	Resource augmentation for weighted flow-time explained by dual fitting	claim
43	170	Compression via matroids: a randomized polynomial kernel for odd cycle transversal	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers