1647 search results - page 176 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
137
click to vote
INFORMATICALT
2010
15 years 3 months ago
2010
We address the issue of inapproximability of the wavelength assignment problem in wavelength division multiplexing (WDM) optical networks. We prove that in an n-node WDM optical ne...
140
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
209
Voted
CORR
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
130
click to vote
DIALM
2008
ACM
15 years 6 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
146
click to vote
INFOCOM
2000
IEEE
15 years 9 months ago
2000
IEEE
Abstract—We investigate the performance of TCP under three representatives of packet scheduling algorithms at the router. Our main focus is to investigate how fair service can be...