Bounded-independance derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming (Q1380803)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bounded-independance derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounded-independance derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming |
scientific article |
Statements
Bounded-independance derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming (English)
0 references
11 March 1998
0 references
\(\varepsilon\)-net
0 references
\(\varepsilon\)-approximations
0 references
range spaces with bounded VC-exponent
0 references
geometric partitioning problems
0 references
