4110 search results - page 5 / 822 » Efficient algorithms for the 2-gathering problem |
93
Voted
ICALP
1998
Springer
15 years 3 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
STOC
1991
ACM
15 years 3 months ago
1991
ACM
act We give an algorithm for imbedding a graph G of n vertices onto an oriented surface of minimal genus g. If g > 0 then we also construct a forbidden subgraph of G which is ho...
92
Voted
INFOCOM
2010
IEEE
14 years 9 months ago
2010
IEEE
RFID has been gaining popularity for inventory control, object tracking, and supply chain management in warehouses, retail stores, hospitals, etc. Periodically and automatically es...
80
Voted
ICCSA
2010
Springer
15 years 1 months ago
2010
Springer
This paper achieves O(n3 log log n/ log n) time for the 2center problems on a directed graph with non-negative edge costs under the conventional RAM model where only arithmetic ope...
IPPS
1997
IEEE
15 years 3 months ago
1997
IEEE