Next Issue

Table of Contents

Algorithms, Volume 1, Issue 1 (September 2008), 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 Readerexternal link to open them.
View options order results:
result details:
Displaying articles 1-3
Export citation of selected articles as:

Editorial

Jump to: Research

Open AccessEditorial Editor's Foreword
Algorithms 2008, 1(1), 1; doi:10.3390/a1010001
Received: 28 August 2008 / Published: 4 September 2008
PDF Full-text (17 KB) | HTML Full-text | XML Full-text

Research

Jump to: Editorial

Open AccessArticle Impact of Locality on Location Aware Unit Disk Graphs
Algorithms 2008, 1(1), 2-29; doi:10.3390/a1010002
Received: 15 August 2008 / Accepted: 4 September 2008 / Published: 12 September 2008
Cited by 4 | PDF Full-text (276 KB)
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. [...] 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
Open AccessArticle Randomized Competitive Analysis for Two Server Problems
Algorithms 2008, 1(1), 30-42; doi:10.3390/a1010030
Received: 13 August 2008 / Accepted: 18 September 2008 / Published: 19 September 2008
Cited by 2 | PDF Full-text (230 KB)
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 [...] 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

Journal Contact

MDPI AG
Algorithms Editorial Office
St. Alban-Anlage 66, 4052 Basel, Switzerland
algorithms@mdpi.com
Tel. +41 61 683 77 34
Fax: +41 61 302 89 18
Editorial Board
Contact Details Submit to Algorithms
Back to Top