Sciweavers

336 search results - page 19 / 68
» Approximating Transitivity in Directed Networks
Sort
View
IPL
2008
90views more  IPL 2008»
13 years 7 months ago
On isomorphisms and similarities between generalized Petersen networks and periodically regular chordal rings
Generalized Petersen (GP) networks and periodically regular chordal (PRC) rings have been proposed independently to ameliorate the high latency and extreme fragility of simple rin...
Behrooz Parhami
INFOCOM
2003
IEEE
14 years 21 days ago
Minimizing Request Blocking in All-Optical Rings
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
FOCS
2002
IEEE
14 years 11 days ago
A Constant-Factor Approximation Algorithm for the Multicommodity
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
Amit Kumar, Anupam Gupta, Tim Roughgarden
WWW
2008
ACM
14 years 8 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan
ESA
2006
Springer
109views Algorithms» more  ESA 2006»
13 years 11 months 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 ...