519 search results - page 3 / 104 » A New Approach to Strongly Polynomial Linear Programming |
JCT
2010
13 years 3 months ago
2010
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
IOR
2006
13 years 5 months ago
2006
We consider the problem of radiation therapy treatment planning for cancer patients. During radiation therapy, beams of radiation pass through a patient, killing both cancerous an...
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
We present a new algorithm for unfolding planar polygonal linkages without self-intersection based on following the gradient flow of a “repulsive” energy function. This algor...