Pages that link to "Template:Cite Geometric Algorithms and Combinatorial Optimization"
The following pages link to Template:Cite Geometric Algorithms and Combinatorial Optimization:
Showing 17 items.
- Alexander Schrijver (transclusion) (links)
- Gaussian elimination (transclusion) (links)
- John ellipsoid (transclusion) (links)
- Polyhedron (transclusion) (links)
- Turing machine (transclusion) (links)
- Minimum spanning tree (transclusion) (links)
- Fully polynomial-time approximation scheme (transclusion) (links)
- Strongly-polynomial time (transclusion) (links)
- Algorithmic problems on convex sets (transclusion) (links)
- N-dimensional polyhedron (transclusion) (links)
- Gram–Schmidt process (transclusion) (links)
- Ellipsoid (transclusion) (links)
- Hermite normal form (transclusion) (links)
- Farkas' lemma (transclusion) (links)
- Geometry of numbers (transclusion) (links)
- Diophantine approximation (transclusion) (links)
- Line perfect graph (transclusion) (links)