Sciweavers

Share
88 search results - page 18 / 18
» On Approximating Minimum Infrequent and Maximum Frequent Set...
Sort
View
SPAA
2003
ACM
12 years 5 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
12 years 1 months ago
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
Ashish Goel, Hamid Nazerzadeh
ALMOB
2006
109views more  ALMOB 2006»
11 years 12 months ago
A novel functional module detection algorithm for protein-protein interaction networks
Background: The sparse connectivity of protein-protein interaction data sets makes identification of functional modules challenging. The purpose of this study is to critically eva...
Woochang Hwang, Young-Rae Cho, Aidong Zhang, Mural...
books