4843 search results - page 273 / 969 » The Shortcut Problem - Complexity and Approximation |
129
Voted
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— The tokamak concept for magnetic confinement of fusion plasmas is now quite mature scientifically. This maturity is evidenced by the ongoing worldwide effort to design and cons...
114
click to vote
ADHOCNOW
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
135
Voted
FSTTCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
123
Voted
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
108
Voted
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...