Next Issue
Volume 1, December
 
 

Algorithms, Volume 1, Issue 1 (September 2008) – 3 articles , Pages 1-42

  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list.
  • You may sign up for e-mail alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.
Order results
Result details
Section
Select all
Export citation of selected articles as:

Editorial

Jump to: Research

17 KiB  
Editorial
Editor's Foreword
by Kazuo Iwama
Algorithms 2008, 1(1), 1; https://doi.org/10.3390/a1010001 - 04 Sep 2008
Viewed by 4101
Abstract
The scope of the topic "algorithms" has been eminently expanded over the past two decades.[...] Full article

Research

Jump to: Editorial

276 KiB  
Article
Impact of Locality on Location Aware Unit Disk Graphs
by Andreas Wiese and Evangelos Kranakis
Algorithms 2008, 1(1), 2-29; https://doi.org/10.3390/a1010002 - 12 Sep 2008
Cited by 4 | Viewed by 7269
Abstract
Due to their importance for studies oi wireless networks, recent years have seen a surge of activity on the design of local algorithms for the solution of a variety of network tasks. We study the behaviour of algorithms with very low localities. Despite [...] Read more.
Due to their importance for studies oi wireless networks, recent years have seen a surge of activity on the design of local algorithms for the solution of a variety of network tasks. We study the behaviour of algorithms with very low localities. Despite of this restriction we propose local constant ratio approximation algorithms for solving minimum dominating and connected dominating set, maximum independent set and minimum vertex cover in location aware Unit Disk Graphs. We also prove the first ever lower bounds for local algorithms for these problems with a given locality in the location aware setting. Full article
Show Figures

Figure 1

230 KiB  
Article
Randomized Competitive Analysis for Two Server Problems
by Wolfgang Bein, Kazuo Iwama and Jun Kawahara
Algorithms 2008, 1(1), 30-42; https://doi.org/10.3390/a1010030 - 19 Sep 2008
Cited by 3 | Viewed by 6817
Abstract
We prove that there exists a randomized online algorithm for the 2-server 3-point problem whose expected competitive ratio is at most 1.5897. This is the first nontrivial upper bound for randomized k-server algorithms in a general metric space whose competitive ratio is [...] Read more.
We prove that there exists a randomized online algorithm for the 2-server 3-point problem whose expected competitive ratio is at most 1.5897. This is the first nontrivial upper bound for randomized k-server algorithms in a general metric space whose competitive ratio is well below the corresponding deterministic lower bound (= 2 in the 2-server case). Full article
Show Figures

Figure 1

Next Issue
Back to TopTop