Sciweavers

448 search results - page 19 / 90
» Fast Approximation Algorithms for Multicommodity Flow Proble...
Sort
View
ICCSA
2004
Springer
14 years 2 months ago
Packing: Scheduling, Embedding, and Approximating Metrics
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...
Hu Zhang
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 9 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
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 ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
SPAA
2010
ACM
14 years 1 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
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...
Matti Åstrand, Jukka Suomela
ESA
2006
Springer
109views Algorithms» more  ESA 2006»
14 years 10 days ago
Multiline Addressing by Network Flow
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...
Friedrich Eisenbrand, Andreas Karrenbauer, Martin ...
EVOW
1999
Springer
14 years 28 days ago
Approximate Equivalence Verification for Protocol Interface Implementation via Genetic Algorithms
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...
Fulvio Corno, Matteo Sonza Reorda, Giovanni Squill...