Sciweavers

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

22

WEA
2005
Springer

favoriteEmaildiscussreport

91views Algorithms» more WEA 2005»

Rectangle Covers Revisited Computationally

14 years 4 months ago

Rectangle Covers Revisited Computationally

Download www.math.tu-berlin.de

Laura Heinrich-Litan, Marco E. Lübbecke

Real-time Traffic

Algorithms | WEA 2005 |

claim paper

Related Content

» Covering a Set of Points in a Plane Using Two Parallel Rectangles

» Covering points by disjoint boxes with outliers

» Algorithms for capacitated rectangle stabbing and lot sizing with joint setup costs

» Cuttings for Disks and AxisAligned Rectangles

» Revisiting SRT Quotient Digit Selection

» Revisiting AckermannHardness for Lossy Counter Machines and Reset Petri Nets

» On the Computation of Colored Domino Tilings of Simple and Nonsimple Orthogonal Polygons

» Fast normal vector compression with bounded error

» FAST Fast Adaptive Silhouette Area based Template Matching

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	WEA
Authors	Laura Heinrich-Litan, Marco E. Lübbecke

Comments (0)