Sciweavers

227 search results - page 45 / 46
» Complexity Results for Compressing Optimal Paths
Sort
View
FOCS
2009
IEEE
15 years 5 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
79
Voted
CN
2006
116views more  CN 2006»
14 years 11 months ago
Techniques for available bandwidth measurement in IP networks: A performance comparison
As the Internet grows in scale and complexity, the need for accurate traffic measurement increases. Among the different parameters relevant to traffic measurement, the paper pays ...
Leopoldo Angrisani, Salvatore D'Antonio, Marcello ...
98
Voted
CORR
2006
Springer
160views Education» more  CORR 2006»
14 years 11 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...
ICNP
2006
IEEE
15 years 5 months ago
Characterizing and Mitigating Inter-domain Policy Violations in Overlay Routes
— The Internet is a complex structure arising from the interconnection of numerous autonomous systems (AS), each exercising its own administrative policies to reflect the commer...
Srinivasan Seetharaman, Mostafa H. Ammar
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 3 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz