Abstract
This paper studies algorithmic Helly-type problems in the framework of the algorithmic theory of convex bodies developed by Grotschel, Lovasz, and Schrijver. Various oracle-polynomial-time algorithms are presented that are complemented by \({\Bbb N \Bbb P}\) -hardness results for polytopes. In addition, some new Helly-type theorems are derived.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
