TALG 2008 - PDF Preprint Papers

TALG 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TALG-2008 Paper

click to vote

TALG
2008

152views more TALG 2008»

Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs

13 years 5 months ago

Download web.mit.edu

In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...

Guy Even, Retsef Levi, Dror Rawitz, Baruch Schiebe...

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	152	Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs	claim
2	131	Kinetic and dynamic data structures for closest pair and all nearest neighbors	claim
3	127	Fully dynamic algorithms for chordal graphs and split graphs	claim
4	124	Uniform deterministic dictionaries	claim
5	122	An asymptotic approximation scheme for multigraph edge coloring	claim
6	115	Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications	claim
7	111	On the approximability of some network design problems	claim
8	110	Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem	claim
9	100	Thin heaps, thick heaps	claim
10	97	Average-case lower bounds for the plurality problem	claim
11	97	On an infinite family of solvable Hanoi graphs	claim
12	93	Approximate distance oracles for geometric spanners	claim
13	93	Limitations of cross-monotonic cost-sharing schemes	claim
14	86	Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut	claim
15	81	Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics	claim
16	80	Balanced parentheses strike back	claim
17	80	Randomized minimum spanning tree algorithms using exponentially fewer random bits	claim
18	75	Compact dictionaries for variable-length keys and data with applications	claim
19	74	Improved bounds for scheduling conflicting jobs with minsum criteria	claim
20	72	Dynamic routing schemes for graphs with low local density	claim
21	70	Approximation schemes for wireless networks	claim
22	69	Testing Euclidean minimum spanning trees in the plane	claim
23	67	Multipartite priority queues	claim
24	67	Structure and linear-time recognition of 4-leaf powers	claim
25	59	Label-guided graph exploration by a finite automaton	claim
26	57	Alternation and redundancy analysis of the intersection problem	claim
27	57	Primal-dual approach for directed vertex connectivity augmentation and generalizations	claim
28	56	Determining plurality	claim
29	39	Faster approximation schemes for fractional multicommodity flow problems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers