Rudolf Fleischer

Erik Meineche Schmidt

Bernhard Moret

Experimental algorithmics, as its name indicates, combines algorithmic work and experimentation: algorithms are not just designed, but also implemented and tested on a variety of instances. Perhaps the most important lesson in this process is that designing an algorithm is but the first step in the process of developing robust and efficient software for applications. Based on a seminar held at Dagstuhl Castle, Germany in September 2000, this state-of-the-art survey presents a coherent survey of the work done in the area so far. The 11 carefully reviewed chapters provide complete coverage of all current topics in experimental algorithmics.

From Algorithm Design to Robust and Efficient Software

Experimental Algorithmics

Roberto Solis-Oba

This book constitutes the thoroughly refereed workshop post-proceedings of the 15th International Workshop on Approximation and Online Algorithms, WAOA 2017, held in Vienna, Austria, in September 2017 as part of ALGO 2017. The 23 revised full papers presented in this book were carefully reviewed and selected from 50 submissions. Topics of interest for WAOA 2017 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.

15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers

Approximation and Online Algorithms

Jinhui Xu

This volume contains the proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM 2008), held June 23–25, 2008, at Fudan University, Shanghai, China. This conference is intended for original algorithmic research on immediate applications and/or fundam- tal problems pertinent to information management and management science, broadly construed. The ?rst three conferences were held in Xi'an (2005), Hong Kong (2006), and Portland (2007). Submissionstothisyear'sconferencewereconductedelectronically.Atotalof 53 papers were submitted from Algeria, Australia, Bangladesh, Canada, China, France, Germany, Iran, Ireland, Italy, Japan, Latvia, Mexico, Netherlands, UK, Ukraine, and the USA. Each paper was evaluated by three ProgramCommittee members from an international Program Committee (listed on the following pages), assisted in some cases by external reviews and comments. Eventually, 31 papers were accepted, but one paper was later withdrawn. In addition to these selected papers, the conference also included two invited keynote talks by Ding-Zhu Du (University of Texas at Dallas and Xi'an Jiaotong University, China) and Vijay V. Vazirani (Georgia Institute of Technology), and a special session on Fixed Parameter Tractable (FPT) algorithms by Mike Fellows, Rolf Niedermeier, Jianer Chen, and Michael Langston.

4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008, Proceedings

Algorithmic Aspects in Information and Management

ISAAC

This book constitutes the refereed proceedings of the 15th International Symposium on Algorithms and Computation, ISAAC 2004, held in Hong Kong, China in December 2004. The 76 revised full papers presented were carefully reviewed and selected from 226 submissions. Among the topics addressed are computational geometry, graph computations, computational combinatorics, combinatorial optimization, computational complexity, scheduling, distributed algorithms, parallel algorithms, data structures, network optimization, randomized algorithms, and computational mathematics more generally.

Rudolf Fleischer

About

Books

Join the club