SODA 2008 - PDF Preprint Papers

SODA 2008 Symposium on Discrete Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SODA-2008 Paper

click to vote

SODA
2008
ACM

200views Algorithms» more SODA 2008»

Clustering for metric and non-metric distance measures

14 years 26 days ago

Download www.cs.uni-paderborn.de

We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...

Marcel R. Ackermann, Johannes Blömer, Christi...

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	200	Clustering for metric and non-metric distance measures	claim
2	185	Better bounds for online load balancing on unrelated machines	claim
3	184	Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm	claim
4	184	On the approximability of influence in social networks	claim
5	156	Approximating TSP on metrics with bounded global growth	claim
6	150	Finding an optimal tree searching strategy in linear time	claim
7	144	Fast dimension reduction using Rademacher series on dual BCH codes	claim
8	143	Dynamic optimality for skip lists and B-trees	claim
9	140	Minimizing average latency in oblivious routing	claim
10	138	Fully polynomial time approximation schemes for stochastic dynamic programs	claim
11	135	Improved algorithms for orienteering and related problems	claim
12	135	Rapid mixing of Gibbs sampling on graphs that are sparse on average	claim
13	134	Fast algorithms for finding proper strategies in game trees	claim
14	133	On the connectivity of dynamic random geometric graphs	claim
15	131	PageRank and the random surfer model	claim
16	131	Approximating connected facility location problems via random facility sampling and core detouring	claim
17	128	Analysis of greedy approximations with nonsubmodular potential functions	claim
18	127	Nondecreasing paths in a weighted graph or: how to optimally read a train schedule	claim
19	126	On distributing symmetric streaming computations	claim
20	125	Ultra-low-dimensional embeddings for doubling metrics	claim
21	124	Competitive queue management for latency sensitive packets	claim
22	123	Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles	claim
23	122	Fast approximation of the permanent for very dense problems	claim
24	122	A fractional model of the border gateway protocol (BGP)	claim
25	118	Geodesic Delaunay triangulation and witness complex in the plane	claim
26	112	The effect of induced subgraphs on quasi-randomness	claim
27	111	On distance to monotonicity and longest increasing subsequence of a data stream	claim
28	110	Fast asynchronous byzantine agreement and leader election with full information	claim
29	110	Why simple hash functions work: exploiting the entropy in a data stream	claim
30	109	Auctions for structured procurement	claim
31	108	Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities	claim
32	108	Dimension augmentation and combinatorial criteria for efficient error-resistant DNA self-assembly	claim
33	106	Exact and efficient 2D-arrangements of arbitrary algebraic curves	claim
34	106	(Almost) optimal coordination mechanisms for unrelated machine scheduling	claim
35	105	Deterministic random walks on regular trees	claim
36	105	Distribution-sensitive point location in convex subdivisions	claim
37	105	Approximation algorithms for labeling hierarchical taxonomies	claim
38	105	Computing large matchings fast	claim
39	104	Ranged hash functions and the price of churn	claim
40	104	Fast and reliable reconstruction of phylogenetic trees with very short edges	claim
41	101	Adaptive local ratio	claim
42	101	Tight lower bounds for selection in randomly ordered streams	claim
43	100	Yet another algorithm for dense max cut: go greedy	claim
44	100	On allocations that maximize fairness	claim
45	100	Maintaining deforming surface meshes	claim
46	100	A tight lower bound for parity in noisy communication networks	claim
47	98	Explicit constructions for compressed sensing of sparse signals	claim
48	97	Stochastic analyses for online combinatorial optimization problems	claim
49	97	Finding one tight cycle	claim
50	96	Greedy drawings of triangulations	claim
51	96	Unconditionally reliable message transmission in directed networks	claim
52	95	Bounded-leg distance and reachability oracles	claim
53	95	Concatenated codes can achieve list-decoding capacity	claim
54	95	On clustering to minimize the sum of radii	claim
55	93	Minimum weight convex Steiner partitions	claim
56	93	Fast load balancing via bounded best response	claim
57	92	An algorithm for improving graph partitions	claim
58	89	Linked decompositions of networks and the power of choice in Polya urns	claim
59	89	Earth mover distance over high-dimensional spaces	claim
60	89	Product growth and mixing in finite groups	claim
61	88	Charity auctions on social networks	claim
62	88	Maximum overhang	claim
63	88	Sampling stable marriages: why spouse-swapping won't work	claim
64	88	A near-linear time algorithm for computing replacement paths in planar directed graphs	claim
65	86	Declaring independence via the sketching of sketches	claim
66	86	Parallel monotonicity reconstruction	claim
67	86	Space-efficient dynamic orthogonal point location, segment intersection, and range reporting	claim
68	85	L(2, 1)-labelling of graphs	claim
69	84	On stars and Steiner stars	claim
70	84	Robust cost colorings	claim
71	83	Splay trees, Davenport-Schinzel sequences, and the deque conjecture	claim
72	82	On properties of random dissections and triangulations	claim
73	82	A plant location guide for the unsure	claim
74	82	Metric clustering via consistent labeling	claim
75	80	Broadcast scheduling: algorithms and complexity	claim
76	80	Designing networks with good equilibria	claim
77	80	Provably good multicore cache performance for divide-and-conquer algorithms	claim
78	79	Computing excluded minors	claim
79	79	Algorithms for distributed functional monitoring	claim
80	78	The hiring problem and Lake Wobegon strategies	claim
81	77	Online make-to-order joint replenishment model: primal dual competitive algorithms	claim
82	76	Non-clairvoyant scheduling with precedence constraints	claim
83	75	Graph balancing: a special case of scheduling unrelated parallel machines	claim
84	75	Recognizing partial cubes in quadratic time	claim
85	75	Approximating general metric distances between a pattern and a text	claim
86	75	Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization	claim
87	74	Algorithms for the coalitional manipulation problem	claim
88	73	Set connectivity problems in undirected graphs and the directed Steiner network problem	claim
89	71	Two-phase greedy algorithms for some classes of combinatorial linear programs	claim
90	70	Optimal universal graphs with deterministic embedding	claim
91	69	Trace reconstruction with constant deletion probability and related results	claim
92	67	On the value of coordination in network design	claim
93	66	Embedding metric spaces in their intrinsic dimension	claim
94	59	Universality of random graphs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers