Pages that link to "Item:Q1688856"
From MaRDI portal
The following pages link to On the combinatorial complexity of approximating polytopes (Q1688856):
Displaying 19 items.
- On the extension complexity of combinatorial polytopes (Q745682) (← links)
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope (Q1315411) (← links)
- On the complexity of polytope isomorphism problems (Q1401558) (← links)
- Oracle-polynomial-time approximation of largest simplices in convex bodies (Q1574577) (← links)
- On affine reducibility of combinatorial polytopes (Q1761001) (← links)
- Strong IP formulations need large coefficients (Q2019425) (← links)
- Covering convex bodies and the closest vector problem (Q2136842) (← links)
- Complexity yardsticks for \(f\)-vectors of polytopes and spheres (Q2197688) (← links)
- Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach (Q2239941) (← links)
- Approximating a planar convex set using a sparse grid (Q2274483) (← links)
- Optimal area-sensitive bounds for polytope approximation (Q2874597) (← links)
- Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes (Q2959185) (← links)
- On the combinatorial complexity of approximating polytopes (Q3132844) (← links)
- On the polytope faces of the graph approximation problem (Q3186827) (← links)
- (Q3395298) (← links)
- Approximate convex intersection detection with applications to width and Minkowski sums (Q5009560) (← links)
- Economical Delone Sets for Approximating Convex Bodies (Q5116467) (← links)
- (Q5325265) (← links)
- Economical convex coverings and applications (Q6583674) (← links)
