Skip to main content
  • Conference proceedings
  • © 2004

Experimental and Efficient Algorithms

Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings

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

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

Conference proceedings info: WEA 2004.

Buy it now

Buying options

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

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

Table of contents (42 papers)

  1. Front Matter

  2. A Hybrid Bin-Packing Heuristic to Multiprocessor Scheduling

    • Adriana C. F. Alvim, Celso C. Ribeiro
    Pages 1-13
  3. Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases

    • Edoardo Amaldi, Leo Liberti, Nelson Maculan, Francesco Maffioli
    Pages 14-29
  4. An Algorithm to Identify Clusters of Solutions in Multimodal Optimisation

    • Pedro J. Ballester, Jonathan N. Carter
    Pages 42-56
  5. Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop Problem

    • Matthieu Basseur, Julien Lemesre, Clarisse Dhaenens, El-Ghazali Talbi
    Pages 72-86
  6. Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P 4’s

    • Hans L. Bodlaender, Celina M. H. de Figueiredo, Marisa Gutierrez, Ton Kloks, Rolf Niedermeier
    Pages 87-99
  7. A Randomized Heuristic for Scene Recognition by Graph Matching

    • Maria C. Boeres, Celso C. Ribeiro, Isabelle Bloch
    Pages 100-113
  8. An Efficient Implementation of a Joint Generation Algorithm

    • Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Leonid Khachiyan
    Pages 114-128
  9. Lempel, Even, and Cederbaum Planarity Method

    • John M. Boyer, Cristina G. Fernandes, Alexandre Noma, José C. de Pina
    Pages 129-144
  10. A Greedy Approximation Algorithm for the Uniform Labeling Problem Analyzed by a Primal-Dual Technique

    • Evandro C. Bracht, Luis A. A. Meira, Flávio K. Miyazawa
    Pages 145-158
  11. Distributed Circle Formation for Anonymous Oblivious Robots

    • Ioannis Chatzigiannakis, Michael Markou, Sotiris Nikoletseas
    Pages 159-174
  12. Engineering Shortest Path Algorithms

    • Camil Demetrescu, Giuseppe F. Italiano
    Pages 191-198
  13. Fingered Multidimensional Search Trees

    • Amalia Duch, Conrado Martínez
    Pages 228-242
  14. Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem

    • Celina M. H. de Figueiredo, Guilherme D. da Fonseca, Vinícius G. P. de Sá, Jeremy Spinrad
    Pages 243-252
  15. Efficient Implementation of the BSP/CGM Parallel Vertex Cover FPT Algorithm

    • Erik J. Hanashiro, Henrique Mongelli, Siang W. Song
    Pages 253-268

Editors and Affiliations

  • Department of Computer Science, Universidade Federal Fluminense, Niterói, Brazil

    Celso C. Ribeiro

  • Departamento de Ciência da Computação, Universidade Federal Fluminense, Niterói, Brazil

    Simone L. Martins

Bibliographic Information

Buy it now

Buying options

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