7129 search results - page 236 / 1426 » Approximation Algorithms for Treewidth |
144
click to vote
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...
121
click to vote
APPROX
2004
Springer
15 years 9 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...
132
click to vote
DCC
1993
IEEE
15 years 8 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...
118
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Running several sub-optimal algorithms and choosing the optimal one is a common procedure in computer science, most notably in the design of approximation algorithms. This paper d...
112
click to vote
CSIE
2009
IEEE
15 years 8 months ago
2009
IEEE
A new algorithm of image layer-presentation was proposed. The key concept of the algorithm was in that the image grayscale function f(x,y), which was comparatively irregular, was ...