Skip to main content
SpringerLink
Log in

Algorithms and Complexity

6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Tiziana Calamoneri

    1. Department of Computer Science, University of Rome, ”Sapienza”, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Irene Finocchi

    1. Computer Science Department, Sapienza University of Rome, Rome, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Giuseppe F. Italiano

    1. Dipartimento di Informatica, Sistemi e Produzione, Università di Roma “Tor Vergata”, Roma, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3998)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: CIAC 2006.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (36 papers)

  1. Front Matter

    Download chapter PDF

  3. Session 1

    1. Covering a Set of Points with a Minimum Number of Lines

      • Magdalene Grantson, Christos Levcopoulos
      Pages 6-17

    2. Approximation Algorithms for Capacitated Rectangle Stabbing

      • Guy Even, Dror Rawitz, Shimon (Moni) Shahar
      Pages 18-29

    3. In-Place Randomized Slope Selection

      • Henrik Blunck, Jan Vahrenhold
      Pages 30-41

  5. Session 3

    1. Network Discovery and Verification with Distance Queries

      • Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matúš Mihaľák
      Pages 69-80

    2. Deciding the FIFO Stability of Networks in Polynomial Time

      • Maik Weinard
      Pages 81-92

    3. Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates

      • Dimitrios Koukopoulos, Stavros D. Nikolopoulos
      Pages 93-104

  6. Session 4

    1. Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups

      • Friedrich Eisenbrand, Edda Happ
      Pages 105-114

    2. Gathering Algorithms on Paths Under Interference Constraints

      • Jean-Claude Bermond, Ricardo Corrêa, Minli Yu
      Pages 115-126

    3. On the Hardness of Range Assignment Problems

      • Bernhard Fuchs
      Pages 127-138

  7. Session 5

    1. Black Hole Search in Asynchronous Rings Using Tokens

      • S. Dobrev, R. Královič, N. Santoro, W. Shi
      Pages 139-150

    2. On Broadcast Scheduling with Limited Energy

      • Christian Gunia
      Pages 151-162

    3. A Near Optimal Scheduler for On-Demand Data Broadcasts

      • Hing-Fung Ting
      Pages 163-174

  8. Session 6

    1. Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines

      • Yvonne Bleischwitz, Burkhard Monien
      Pages 175-186
Back to top

Other volumes

  1. Algorithms and Complexity

Keywords

Editors and Affiliations

  • Department of Computer Science, University of Rome, ”Sapienza”, Italy

    Tiziana Calamoneri

  • Computer Science Department, Sapienza University of Rome, Rome, Italy

    Irene Finocchi

  • Dipartimento di Informatica, Sistemi e Produzione, Università di Roma “Tor Vergata”, Roma, Italy

    Giuseppe F. Italiano

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation