SODA 2004 - PDF Preprint Papers

SODA 2004 Symposium on Discrete Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SODA-2004 Paper

click to vote

SODA
2004
ACM

203views Algorithms» more SODA 2004»

Approximation schemes for multidimensional packing

14 years 24 days ago

Download www.cs.brown.edu

We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...

José R. Correa, Claire Kenyon

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	203	Approximation schemes for multidimensional packing	claim
2	173	Tabulation based 4-universal hashing with applications to second moment estimation	claim
3	161	Approximation schemes for Metric Bisection and partitioning	claim
4	160	Complexities for generalized models of self-assembly	claim
5	160	On colorings of squares of outerplanar graphs	claim
6	156	Approximating Minimum Max-Stretch spanning Trees on unweighted graphs	claim
7	155	Navigating nets: simple algorithms for proximity search	claim
8	152	Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs	claim
9	151	Minimum moment Steiner trees	claim
10	146	Approximating the two-level facility location problem via a quasi-greedy approach	claim
11	144	Covering minimum spanning trees of random subgraphs	claim
12	137	The Bloomier filter: an efficient data structure for static support lookup tables	claim
13	137	Correlation Clustering: maximizing agreements via semidefinite programming	claim
14	131	Compression boosting in optimal linear time using the Burrows-Wheeler Transform	claim
15	131	When indexing equals compression: experiments with compressing suffix arrays and applications	claim
16	128	Computing equilibria for congestion games with (im)perfect information	claim
17	128	Equivalence of local treewidth and linear local treewidth and its algorithmic applications	claim
18	128	Frugality in path auctions	claim
19	127	An optimal randomized algorithm for maximum Tukey depth	claim
20	124	On contract-and-refine transformations between phylogenetic trees	claim
21	124	Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time	claim
22	121	A characterization of easily testable induced subgraphs	claim
23	120	Optimal routing in Chord	claim
24	119	Structural and algorithmic aspects of massive social networks	claim
25	118	The maximum latency of selfish routing	claim
26	116	Retroactive data structures	claim
27	115	Minimizing the stabbing number of matchings, trees, and triangulations	claim
28	111	Almost-Delaunay simplices: nearest neighbor relations for imprecise points	claim
29	111	Reconstructing strings from random traces	claim
30	111	Fast mixing for independent sets, colorings and other models on trees	claim
31	110	Probabilistic analysis of knapsack core algorithms	claim
32	110	Slow mixing of Glauber dynamics for the hard-core model on the hypercube	claim
33	110	Algorithms for infinite huffman-codes	claim
34	108	A certifying algorithm for the consecutive-ones property	claim
35	107	A note on the nearest neighbor in growth-restricted metrics	claim
36	104	Variable length path coupling	claim
37	104	Tight bounds for the partial-sums problem	claim
38	102	The hyperring: a low-congestion deterministic data structure for distributed environments	claim
39	102	A deterministic near-linear time algorithm for finding minimum cuts in planar graphs	claim
40	102	An exact subexponential-time lattice algorithm for Asian options	claim
41	98	End-to-end packet-scheduling in wireless ad-hoc networks	claim
42	96	Non-migratory online deadline scheduling on multiprocessors	claim
43	95	Buffer minimization using max-coloring	claim
44	94	Quantitative stochastic parity games	claim
45	94	Fair and efficient router congestion control	claim
46	94	Improved upper bounds for 3-SAT	claim
47	94	A time efficient Delaunay refinement algorithm	claim
48	93	On the number of rectangular partitions	claim
49	93	Bipartite roots of graphs	claim
50	92	Facility location with Service Installation Costs	claim
51	91	Competitive analysis of organization networks or multicast acknowledgement: how much to wait?	claim
52	90	Compact representations of ordered sets	claim
53	89	Interpolation search for non-independent data	claim
54	89	The number of bit comparisons used by Quicksort: an average-case analysis	claim
55	89	Approximate local search in combinatorial optimization	claim
56	88	Constructing finite field extensions with large order elements	claim
57	87	Optimal space lower bounds for all frequency moments	claim
58	83	Caching queues in memory buffers	claim
59	82	Dynamizing static algorithms, with applications to dynamic trees and history independence	claim
60	82	On finding a guard that sees most and a shop that sells most	claim
61	81	Approximate classification via earthmover metrics	claim
62	81	Invadable self-assembly: combining robustness with efficiency	claim
63	81	Succinct ordinal trees with level-ancestor queries	claim
64	80	Efficient algorithms for bichromatic separability	claim
65	80	Output-sensitive construction of the union of triangles	claim
66	80	Adaptive sampling for quickselect	claim
67	76	Experimental analysis of dynamic all pairs shortest path algorithms	claim
68	76	A maiden analysis of Longest Wait First	claim
69	76	Network failure detection and graph connectivity	claim
70	75	Simultaneous diophantine approximation with excluded primes	claim
71	74	Torpid mixing of simulated tempering on the Potts model	claim
72	67	Trade-offs on the location of the core node in a network	claim
73	66	Windows scheduling as a restricted version of Bin Packing	claim
74	64	Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs	claim
75	60	SRPT optimally utilizes faster machines to minimize flow time	claim
76	59	A new algorithm for normal dominance constraints	claim
77	58	Point containment in the integer hull of a polyhedron	claim
78	53	Efficient estimation algorithms for neighborhood variance and other moments	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers