Sciweavers

806 search results - page 7 / 162
» Lower Bounds on Correction Networks
Sort
View
ENDM
2010
101views more  ENDM 2010»
13 years 7 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
STOC
1995
ACM
117views Algorithms» more  STOC 1995»
13 years 11 months ago
Lower bounds for sorting networks
Nabil Kahale, Frank Thomson Leighton, Yuan Ma, C. ...
JPDC
1998
54views more  JPDC 1998»
13 years 7 months ago
Lower Bounds for Dynamic Tree Embedding in Bipartite Networks
Keqin Li, Yi Pan, Hong Shen, Gilbert H. Young, Si-...