Sciweavers

422 search results - page 84 / 85
» Shortest paths between shortest paths and independent sets
Sort
View
SAGT
2009
Springer
140views Game Theory» more  SAGT 2009»
13 years 12 months ago
Price of Stability in Survivable Network Design
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...
Elliot Anshelevich, Bugra Caskurlu
TPDS
2008
80views more  TPDS 2008»
13 years 5 months ago
Scalable and Efficient End-to-End Network Topology Inference
To construct an efficient overlay network, the information of underlay is important. We consider using end-to-end measurement tools such as traceroute to infer the underlay topolog...
Xing Jin, Wanqing Tu, S.-H. Gary Chan
TELSYS
2002
128views more  TELSYS 2002»
13 years 5 months ago
An Evaluation of Shared Multicast Trees with Multiple Cores
Native multicast routing protocols have been built and deployed using two basic types of trees: singlesource, shortest-path trees and shared, core-based trees. Core-based multicas...
Daniel Zappala, Aaron Fabbri, Virginia Mary Lo
BMCBI
2010
175views more  BMCBI 2010»
13 years 5 months ago
The BridgeDb framework: standardized access to gene, protein and metabolite identifier mapping services
Background: Many complementary solutions are available for the identifier mapping problem. This creates an opportunity for bioinformatics tool developers. Tools can be made to fle...
Martijn P. van Iersel, Alexander R. Pico, Thomas K...
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 5 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...