Sciweavers

8 search results - page 1 / 2
» The Online-TSP against Fair Adversaries
Sort
View
CIAC
2000
Springer
104views Algorithms» more  CIAC 2000»
13 years 9 months ago
The Online-TSP against Fair Adversaries
Michiel Blom, Sven Oliver Krumke, Willem de Paepe,...
CPC
2007
97views more  CPC 2007»
13 years 5 months ago
On an Online Spanning Tree Problem in Randomly Weighted Graphs
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
Jan Remy, Alexander Souza, Angelika Steger
PODC
2006
ACM
13 years 11 months ago
Adversarial queuing on the multiple-access channel
We consider deterministic distributed broadcasting on multiple access channels in the framework of adversarial queuing. Packets are injected dynamically by an adversary that is co...
Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A....
ICDCS
2011
IEEE
12 years 5 months ago
Competitive and Fair Medium Access Despite Reactive Jamming
Abstract—Intentional interference constitutes a major threat for communication networks operating over a shared medium where availability is imperative. Jamming attacks are often...
Andréa W. Richa, Christian Scheideler, Stef...
SSS
2007
Springer
100views Control Systems» more  SSS 2007»
13 years 11 months ago
Stability of the Multiple-Access Channel Under Maximum Broadcast Loads
We investigate deterministic broadcasting on multiple-access channels in the framework of adversarial queuing. A protocol is stable when the number of packets stays bounded, and it...
Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A....