7006 search results - page 227 / 1402 » Approximation Algorithms |
138
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
We study several multi-criteria undirected network design problems with node costs and lengths. All these problems are related to the Multicommodity Buy at Bulk (MBB) problem in w...
110
Voted
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
We study the problem of minimizing the broadcast time for a set of processors in a cluster, where processor has transmission time , which is the time taken to send a message to any...
126
click to vote
DCC
1993
IEEE
15 years 7 months ago
1993
IEEE
Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the wo...
128
click to vote
ICRA
2005
IEEE
15 years 9 months ago
2005
IEEE
— For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...
130
Voted
IPCO
2010
15 years 1 months ago
2010
We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of ad...