334 search results - page 39 / 67 » Approximation Algorithms for Non-Uniform Buy-at-Bulk Network... |
CCCG
2007
13 years 10 months ago
2007
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...
NETWORKING
2007
13 years 10 months ago
2007
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
Many web-based systems have a tiered application architecture, in which a request needs to transverse all the tiers before finishing its processing. One of the most important QoS...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...