448 search results - page 19 / 90 » Fast Approximation Algorithms for Multicommodity Flow Proble... |
ICCSA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
103
click to vote
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize amplitude of the electrical current through the diodes whic...
64
Voted
EVOW
1999
Springer
15 years 1 months ago
1999
Springer
This paper describes a new approximate approach for checking the correctness of the implementation of a protocol interface, comparing its lowlevel implementation with its high-leve...