509 search results - page 85 / 102 » Lower Bounds for Approximation Algorithms for the Steiner Tr... |
123
Voted
TCS
2008
15 years 3 months ago
2008
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
126
Voted
TIP
1998
15 years 3 months ago
1998
This paper examines the relationship between wavelet-based image processing algorithms and variational problems. Algorithms are derived as exact or approximate minimizers of varia...
139
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
151
Voted
RANDOM
1998
Springer
15 years 7 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
138
Voted
COCOA
2009
Springer
15 years 8 months ago
2009
Springer
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...