Skip to main content
SpringerLink
Log in

Experimental and Efficient Algorithms

4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings

  • Conference proceedings
  • © 2005

Overview

Editors:
  1. Sotiris E. Nikoletseas

    1. CTI and Univ. of Patras, Greece

    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 3503)

Part of the book sub series: Programming and Software Engineering (LNPSE)

Included in the following conference series:

Conference proceedings info: WEA 2005.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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 (57 papers)

  1. Front Matter

    Download chapter PDF

  3. Contributed Regular Papers

    1. The “Real” Approximation Factor of the MST Heuristic for the Minimum Energy Broadcasting

      • Michele Flammini, Alfredo Navarra, Stephane Perennes
      Pages 22-31

    2. Implementing Minimum Cycle Basis Algorithms

      • Kurt Mehlhorn, Dimitrios Michail
      Pages 32-43

    3. Rounding to an Integral Program

      • Refael Hassin, Danny Segev
      Pages 44-54

    4. Rectangle Covers Revisited Computationally

      • L. Heinrich-Litan, M. E. Lübbecke
      Pages 55-66

    5. Don’t Compare Averages

      • Holger Bast, Ingmar Weber
      Pages 67-76

    6. Experimental Results for Stackelberg Scheduling Strategies

      • A. C. Kaporis, L. M. Kirousis, E. I. Politopoulou, P. G. Spirakis
      Pages 77-88

    7. An Improved Branch-and-Bound Algorithm for the Test Cover Problem

      • Torsten Fahle, Karsten Tiemann
      Pages 89-100

    8. Degree-Based Treewidth Lower Bounds

      • Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender
      Pages 101-112

    9. Inferring AS Relationships: Dead End or Lively Beginning?

      • Xenofontas Dimitropoulos, Dmitri Krioukov, Bradley Huffaker, kc claffy, George Riley
      Pages 113-125

    10. Acceleration of Shortest Path and Constrained Shortest Path Computation

      • Ekkehard Köhler, Rolf H. Möhring, Heiko Schilling
      Pages 126-138

    11. A General Buffer Scheme for the Windows Scheduling Problem

      • Amotz Bar-Noy, Jacob Christensen, Richard E. Ladner, Tami Tamir
      Pages 139-151

    12. Implementation of Approximation Algorithms for the Multicast Congestion Problem

      • Qiang Lu, Hu Zhang
      Pages 152-164

    13. Frequency Assignment and Multicoloring Powers of Square and Triangular Meshes

      • Mustapha Kchikech, Olivier Togni
      Pages 165-176

    14. From Static Code Distribution to More Shrinkage for the Multiterminal Cut

      • Bram De Wachter, Alexandre Genon, Thierry Massart
      Pages 177-188

    15. Partitioning Graphs to Speed Up Dijkstra’s Algorithm

      • Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm
      Pages 189-202

    16. Efficient Convergence to Pure Nash Equilibria in Weighted Network Congestion Games

      • Panagiota N. Panagopoulou, Paul G. Spirakis
      Pages 203-215
Back to top

Keywords

Editors and Affiliations

  • CTI and Univ. of Patras, Greece

    Sotiris E. Nikoletseas

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation