39 search results - page 5 / 8 » Approximation Algorithms for Some Optimum Communication Span... |
151
Voted
WADS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
144
Voted
FOCS
2002
IEEE
15 years 7 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
156
Voted
FSTTCS
2003
Springer
15 years 8 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
121
Voted
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
155
Voted
ASIAMS
2007
IEEE
15 years 9 months ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...