Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Link opens in a new tab
Search content at Illinois Experts
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Fast LP-based approximations for geometric packing and covering problems
Chandra Chekuri
,
Sariel Har-Peled
, Kent Quanrud
Siebel School of Computing and Data Science
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Fast LP-based approximations for geometric packing and covering problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximation Bound
50%
Approximation Scheme
50%
Computational Geometry
50%
Constant-factor Approximation Algorithm
50%
Covering Problem
100%
Dynamic Data Structures
50%
Emptiness
50%
Fast Approximation
50%
Geometric Covering
100%
Geometric Data Structures
50%
Geometric Packing
100%
Geometry Optimization
50%
LP Relaxation
50%
Mixed Packing
100%
Nearly-linear Time
50%
Optimization Problem
50%
Oracle
50%
Packing Problem
100%
Range Space
50%
Rounding Algorithm
50%
Side Constraints
100%
Computer Science
Approximation (Algorithm)
100%
Approximation Algorithms
50%
approximation scheme
50%
Computational Geometry
50%
Constant Factor
50%
Data Structure
100%
Optimization Problem
50%
Rounding Algorithm
50%
Side Constraint
100%
Mathematics
Approximates
50%
Constant Factor
50%
Covering Problem
100%
Data Structure
100%
Linear Time
50%
Rounding
100%