Pages that link to "Template:Cite Geometric Algorithms and Combinatorial Optimization"
Jump to navigation
Jump to search
The following pages link to Template:Cite Geometric Algorithms and Combinatorial Optimization:
Displaying 21 items.
- Gaussian elimination (transclusion) (← links)
- Polyhedron (transclusion) (← links)
- Turing machine (transclusion) (← links)
- Minimum spanning tree (transclusion) (← links)
- Gram–Schmidt process (transclusion) (← links)
- Ellipsoid (transclusion) (← links)
- Geometry of numbers (transclusion) (← links)
- Diophantine approximation (transclusion) (← links)
- Independent set (graph theory) (transclusion) (← links)
- Approximation error (transclusion) (← links)
- Fully polynomial-time approximation scheme (transclusion) (← links)
- Farkas' lemma (transclusion) (← links)
- Ellipsoid method (transclusion) (← links)
- Hermite normal form (transclusion) (← links)
- John ellipsoid (transclusion) (← links)
- Lovász number (transclusion) (← links)
- Separation oracle (transclusion) (← links)
- Matching polytope (transclusion) (← links)
- Strongly-polynomial time (transclusion) (← links)
- Algorithmic problems on convex sets (transclusion) (← links)
- N-dimensional polyhedron (transclusion) (← links)