Three views of LP-type optimization problems

@misc{citeulike:625052, abstract = {An axiomatically de ned class of optimization problems, called LP-type problems (or also generalized linear programming problems) and introduced by Sharir and Welzl, includes linear programming, the smallest enclosing ball for a given point set in R , and many other important problems. We investigate mathematical properties of LPtype problems. In particular, we introduce two axiomatic de nitions, the concrete LP-type problems and the acyclic violator spaces, and we show that they...}, author = {Matousek, Jiri and Skovron, Petr }, citeulike-article-id = {625052}, keywords = {clustering}, posted-at = {2006-05-12 13:44:16}, priority = {2}, title = {Three views of LP-type optimization problems}, url = {http://citeseer.ist.psu.edu/matousek03three.html} }

TY - GEN ID - citeulike:625052 L3 - citeulike-article-id:625052 TI - Three views of LP-type optimization problems N2 - An axiomatically de ned class of optimization problems, called LP-type problems (or also generalized linear programming problems) and introduced by Sharir and Welzl, includes linear programming, the smallest enclosing ball for a given point set in R , and many other important problems. We investigate mathematical properties of LPtype problems. In particular, we introduce two axiomatic de nitions, the concrete LP-type problems and the acyclic violator spaces, and we show that they... KW - clustering AU - Matousek, Jiri AU - Skovron, Petr UR - http://citeseer.ist.psu.edu/matousek03three.html ER -