Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

28

STACS
1993
Springer

favoriteEmaildiscussreport

81views Theoretical Computer Science» more STACS 1993»

Exact Algorithms for a Geometric Packing Problem (Extended Abstract)

14 years 3 months ago

Exact Algorithms for a Geometric Packing Problem (Extended Abstract)

Download www.mpi-inf.mpg.de

Ludek Kucera, Kurt Mehlhorn, B. Preis, E. Schwarze

Real-time Traffic

STACS 1993 | Theoretical Computer Science |

claim paper

Related Content

» Online PrimalDual Algorithms for Covering and Packing Problems

» Exact join detection for convex polyhedra and other numerical abstractions

» Practical Approximation Algorithms for Separable Packing Linear Programs

» Geometric Optimization Problems Over Sliding Windows

» Distributed algorithms for covering packing and maximum weighted matching

» Calligraphic packing

» Bidimensionality and geometric graphs

» Separation algorithms for 01 knapsack polytopes

» Exact arrangements on tori and Dupin cyclides

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1993
Where	STACS
Authors	Ludek Kucera, Kurt Mehlhorn, B. Preis, E. Schwarzenecker

Comments (0)