CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 On a Cone Covering Problem Khaled Elbassioni∗ - Cross-polytope - Document - PDFSEARCH.IO

First Page	Meta Content
	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 On a Cone Covering Problem Khaled Elbassioni∗ Add to Reading List Document Date: 2008-10-29 00:04:09 Open Document File Size: 132,44 KB Share Result on Facebook City Berlin / / Country Germany / / Currency pence / / / IndustryTerm polynomial-time algorithms / output-sensitive algorithm / convex hull algorithms / polynomial time algorithm / / Organization Max Planck Institut f¨ / / Person Max Planck / Hans Raj Tiwary / Rd / Khaled Elbassioni / / Position Rt / Rt for some arbitrary k ≤ d / affine subspace Rt / given subspace Rt / Rt / I] / / Technology convex hull algorithms / polynomial time algorithm / polynomial-time algorithms / / SocialTag Linear programming Convex hull Cross-polytope Duality Cone Polyhedral combinatorics Abstract polytope Geometry Polytopes Convex polytope

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 On a Cone Covering Problem Khaled Elbassioni∗ Add to Reading List