3019 search results - page 83 / 604 » Approximating the Domatic Number |
122
click to vote
WADS
2007
Springer
15 years 6 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
107
click to vote
WAOA
2007
Springer
15 years 6 months ago
2007
Springer
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
ANSS
2005
IEEE
15 years 5 months ago
2005
IEEE
We consider a traffic-groomed optical network consisting of N nodes arranged in tandem. This optical network is modeled by a tandem queueing network of multi-rate loss queues with...
IWANN
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. This paper presents k-NN as an approximator for time series prediction problems. The main advantage of this approximator is its simplicity. Despite the simplicity, k-NN c...
107
click to vote
COMPGEOM
2000
ACM
15 years 4 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...