2477 search results - page 126 / 496 » Approximate extended formulations |
142
Voted
CCCG
1997
15 years 5 months ago
1997
Motivated by the problem of labeling maps, we investigate the problem of computing a large non-intersecting subset in a set of n rectangles in the plane. Our results are as follow...
173
click to vote
NETWORKING
2000
15 years 5 months ago
2000
We present an approximate analytical method to compute efficiently the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairl...
129
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
113
click to vote
ALGORITHMICA
2004
15 years 4 months ago
2004
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
134
click to vote
NA
2007
15 years 3 months ago
2007
Runge-Kutta (RK) pairs furnish approximations of the solution of an initial value problem at discrete points in the interval of integration. Many techniques for enriching these met...