Skip to main content
SpringerLink
Log in

Experimental and Efficient Algorithms

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

  • Conference proceedings
  • © 2004

Overview

Editors:
  1. Celso C. Ribeiro

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Simone L. Martins

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

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

Included in the following conference series:

Conference proceedings info: WEA 2004.

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 (42 papers)

  1. Front Matter

    Download chapter PDF

  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. Solving Chance-Constrained Programs Combining Tabu Search and Simulation

    • Roberto Aringhieri
    Pages 30-41

  5. An Algorithm to Identify Clusters of Solutions in Multimodal Optimisation

    • Pedro J. Ballester, Jonathan N. Carter
    Pages 42-56

  6. On an Experimental Algorithm for Revenue Management for Cargo Airlines

    • Paul Bartodziej, Ulrich Derigs
    Pages 57-71

  7. 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

  8. 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

  9. A Randomized Heuristic for Scene Recognition by Graph Matching

    • Maria C. Boeres, Celso C. Ribeiro, Isabelle Bloch
    Pages 100-113

  10. An Efficient Implementation of a Joint Generation Algorithm

    • Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Leonid Khachiyan
    Pages 114-128

  11. Lempel, Even, and Cederbaum Planarity Method

    • John M. Boyer, Cristina G. Fernandes, Alexandre Noma, José C. de Pina
    Pages 129-144

  12. 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

  13. Distributed Circle Formation for Anonymous Oblivious Robots

    • Ioannis Chatzigiannakis, Michael Markou, Sotiris Nikoletseas
    Pages 159-174

  14. Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems

    • Glauber Cintra, Yoshiko Wakabayashi
    Pages 175-190

  15. Engineering Shortest Path Algorithms

    • Camil Demetrescu, Giuseppe F. Italiano
    Pages 191-198

  16. How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas

    • Tassos Dimitriou, Paul Spirakis
    Pages 199-212

  17. Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem

    • Jingde Du, Stavros G. Kolliopoulos
    Pages 213-227

  18. Fingered Multidimensional Search Trees

    • Amalia Duch, Conrado Martínez
    Pages 228-242

  19. 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

  20. Efficient Implementation of the BSP/CGM Parallel Vertex Cover FPT Algorithm

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

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation