Sciweavers

Share
WEA
2005
Springer
91views Algorithms» more  WEA 2005»
9 years 26 days ago
The Necessity of Timekeeping in Adversarial Queueing
We study queueing strategies in the adversarial queueing model. Rather than discussing individual prominent queueing strategies we tackle the issue on a general level and analyze c...
Maik Weinard
WEA
2005
Springer
93views Algorithms» more  WEA 2005»
9 years 26 days ago
From Static Code Distribution to More Shrinkage for the Multiterminal Cut
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design e...
Bram De Wachter, Alexandre Genon, Thierry Massart
WEA
2005
Springer
105views Algorithms» more  WEA 2005»
9 years 26 days ago
Inferring AS Relationships: Dead End or Lively Beginning?
Recent techniques for inferring business relationships between ASs [3, 8] have yielded maps that have extremely few invalid BGP paths in the terminology of Gao [9]. However, some ...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, B...
WEA
2005
Springer
107views Algorithms» more  WEA 2005»
9 years 26 days ago
Local Clustering of Large Graphs by Approximate Fiedler Vectors
Vectors [Extended Abstract] Pekka Orponen and Satu Elisa Schaeffer Laboratory for Theoretical Computer Science, P.O. Box 5400 FI-02015 TKK Helsinki University of Technology, Finlan...
Pekka Orponen, Satu Elisa Schaeffer
WEA
2005
Springer
109views Algorithms» more  WEA 2005»
9 years 26 days ago
Synchronization Fault Cryptanalysis for Breaking A5/1
Abstract. A5/1 pseudo-random bit generator, known from GSM networks, potentially might be used for different purposes, such as secret hiding during cryptographic hardware testing, ...
Marcin Gomulkiewicz, Miroslaw Kutylowski, Heinrich...
WEA
2005
Springer
294views Algorithms» more  WEA 2005»
9 years 26 days ago
Partitioning Graphs to Speed Up Dijkstra's Algorithm
Rolf H. Möhring, Heiko Schilling, Birk Sch&uu...
WEA
2005
Springer
98views Algorithms» more  WEA 2005»
9 years 26 days ago
Implementing Minimum Cycle Basis Algorithms
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
Kurt Mehlhorn, Dimitrios Michail
WEA
2005
Springer
154views Algorithms» more  WEA 2005»
9 years 26 days ago
Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
Mark K. Goldberg, D. Hollinger, Malik Magdon-Ismai...
WEA
2005
Springer
97views Algorithms» more  WEA 2005»
9 years 26 days ago
Multiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces
Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...
Domenico Cantone, Alfredo Ferro, Rosalba Giugno, G...
WEA
2005
Springer
120views Algorithms» more  WEA 2005»
9 years 26 days ago
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms
Abstract. We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over ...
Filippo Geraci, Roberto Grossi
books