3. WEA 2004: Angra dos Reis, Brazil
Celso C. Ribeiro, Simone L. Martins (Eds.): Experimental and Efficient Algorithms, Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings. Springer 2004 Lecture Notes in Computer Science ISBN 3-540-22067-4- Adriana C. F. Alvim, Celso C. Ribeiro: A Hybrid Bin-Packing Heuristic to Multiprocessor Scheduling. 1-13
- Edoardo Amaldi, Leo Liberti, Nelson Maculan, Francesco Maffioli: Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases. 14-29
- Roberto Aringhieri: Solving Chance-Constrained Programs Combining Tabu Search and Simulation. 30-41
- Pedro J. Ballester, Jonathan N. Carter: An Algorithm to Identify Clusters of Solutions in Multimodal Optimisation. 42-56
- Paul Bartodziej, Ulrich Derigs: On an Experimental Algorithm for Revenue Management for Cargo Airlines. 57-71
- Matthieu Basseur, Julien Lemesre, Clarisse Dhaenens, El-Ghazali Talbi: Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop Problem. 72-86
- Hans L. Bodlaender, Celina M. Herrera de Figueiredo, Marisa Gutierrez, Ton Kloks, Rolf Niedermeier: Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's. 87-99
- Maria C. Boeres, Celso C. Ribeiro, Isabelle Bloch: A Randomized Heuristic for Scene Recognition by Graph Matching. 100-113
- Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: An Efficient Implementation of a Joint Generation Algorithm. 114-128
- John M. Boyer, Cristina G. Fernandes, Alexandre Noma, José Coelho de Pina: Lempel, Even, and Cederbaum Planarity Method. 129-144
- Evandro C. Bracht, Luis A. A. Meira, Flavio Keidi Miyazawa: A Greedy Approximation Algorithm for the Uniform Labeling Problem Analyzed by a Primal-Dual Technique. 145-158
- Ioannis Chatzigiannakis, Michael Markou, Sotiris E. Nikoletseas: Distributed Circle Formation for Anonymous Oblivious Robots. 159-174
- Glauber Cintra, Yoshiko Wakabayashi: Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems. 175-190
- Tassos Dimitriou, Paul G. Spirakis: How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas. 199-212
- Jingde Du, Stavros G. Kolliopoulos: Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem. 213-227
- Celina M. Herrera de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy Spinrad: Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem. 243-252
- Erik J. Hanashiro, Henrique Mongelli, Siang W. Song: Efficient Implementation of the BSP/CGM Parallel Vertex Cover FPT Algorithm. 253-268
- Martin Holzer, Frank Schulz, Thomas Willhalm: Combining Speed-Up Techniques for Shortest-Path Computations. 269-284
- Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Navarro: Increased Bit-Parallelism for Approximate String Matching. 285-298
- Richard M. Karp: The Role of Experimental Algorithms in Genomics. 299-300
- Dong Kyue Kim, Junha Jo, Heejin Park: A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets. 301-314
- Corinne Lucet, Florence Mendes, Aziz Moukrim: Pre-processing and Linear-Decomposition Algorithm to Solve the k-Colorability Problem. 315-325
- Carlos A. J. Martinhon, Fábio Protti: An Improved Derandomized Approximation Algorithm for the Max-Controlled Set Problem. 341-355
- Carlos A. S. Oliveira, Panos M. Pardalos, Mauricio G. C. Resende: GRASP with Path-Relinking for the Quadratic Assignment Problem. 356-368
- Francisco Javier Ovalle-Martínez, Ivan Stojmenovic, Fabian Garcia Nocetti, Julio Solano-González: Finding Minimum Transmission Radii for Preserving Connectivity and Constructing Minimal Spanning Trees in Ad Hoc and Sensor Networks. 369-382
- David J. Pearce, Paul H. J. Kelly: A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs. 383-398
- Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman: Approximating Interval Coloring and Max-Coloring in Chordal Graphs. 399-416
- Joaquín Pérez, Rodolfo A. Pazos, Juan Frausto Solís, Guillermo Rodríguez, David Romero, Laura Cruz: A Statistical Approach for Algorithm Selection. 417-431
- Vinhthuy T. Phan, Steven Skiena: An Improved Time-Sensitive Metaheuristic Framework for Combinatorial Optimization. 432-445
- Paulo Eustáquio Duarte Pinto, Fábio Protti, Jayme Luiz Szwarcfiter: A Huffman-Based Error Detecting Code. 446-457
- Andréa C. dos Santos, Abilio Lucena, Celso C. Ribeiro: Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs. 458-467
- Haroldo G. Santos, Luiz Satoru Ochi, Marcone J. F. Souza: An Efficient Tabu Search Heuristic for the School Timetabling Problem. 468-481
- Daniel Sawitzki: Experimental Studies of Symbolic Shortest-Path Algorithms. 482-497
- Geiza C. Silva, Luiz Satoru Ochi, Simone L. Martins: Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem. 498-512
- Ranjan Sinha: Using Compact Tries for Cache-Efficient Sorting of Integers. 513-528
- Ranjan Sinha, Justin Zobel: Using Random Sampling to Build Approximate Tries for Efficient String Sorting. 529-544
- Cid C. de Souza, André M. Lima, Nahri Moreano, Guido Araujo: The Datapath Merging Problem in Reconfigurable Systems: Lower Bounds and Heuristic Evaluation. 545-558
- Alexandre Tarassov, Nikola S. Nikolov, Jürgen Branke: A Heuristic for Minimum-Width Graph Layering with Consideration of Dummy Nodes. 570-583
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team