Fun with Algorithms - 4th International Conference, Fun 2007, Castiglioncello, Italy

This book constitutes the refereed proceedings of the 4th International Conference on Fun with Algorithms, FUN 2007, held in Castiglioncello, Italy in June 2007, co-located with the 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2007).

The 20 revised full papers presented together with three invited papers were carefully reviewed and selected from 41 submissions. The papers are dedicated to the use, design, and analysis of algorithms and data structures, focusing on results that provide amusing, witty, but nonetheless original and scientifically profound, contributions to the area.

Written for: Researchers and professionals

Keywords: NP-complete problems, Web graph, Web spam, algorithms, anonymous networks, approximation, combinatorial optimization, combinatorics, complexity, computational geometry, computational graph theory, distributed algorithms, geometric algorithms, graph algorithms, graph computations, intrusion detection, mobile agents, network algorithms, optical computing, page-rank, routing, scheduling, transportation problems.