Skip to main content
  • Conference proceedings
  • © 2005

Experimental and Efficient Algorithms

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

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

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

Conference series link(s): WEA: International Workshop on Experimental and Efficient Algorithms

Conference proceedings info: WEA 2005.

Buying options

eBook USD 84.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (57 papers)

  1. Front Matter

  2. 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. From Static Code Distribution to More Shrinkage for the Multiterminal Cut

      • Bram De Wachter, Alexandre Genon, Thierry Massart
      Pages 177-188
    13. Partitioning Graphs to Speed Up Dijkstra’s Algorithm

      • Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm
      Pages 189-202
    14. Efficient Convergence to Pure Nash Equilibria in Weighted Network Congestion Games

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

Other Volumes

  1. Experimental and Efficient Algorithms

Keywords

  • Erfüllbarkeitsproblem der Aussagenlogik
  • Performance
  • algorithmics
  • algorithms
  • algorithms design
  • algorithms engineering
  • algorithms implementation
  • approxima
  • calculus
  • combinatorial optimization
  • computational mathematics
  • efficient algorithms
  • game theory
  • optimization
  • programming
  • algorithm analysis and problem complexity
  • data structures

Editors and Affiliations

  • CTI and Univ. of Patras, Greece

    Sotiris E. Nikoletseas

Bibliographic Information

Buying options

eBook USD 84.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions