Alles über E-Books | Antworten auf Fragen rund um E-Books, Kopierschutz und Dateiformate finden Sie in unserem Info- & Hilfebereich.
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.
Series
Language
Place of publication
Publishing group
Illustrations
File size
ISBN-13
978-3-540-72914-3 (9783540729143)
DOI
10.1007/978-3-540-72914-3
Schweitzer Classification
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features.- Close Encounters with a Black Hole or Explorations and Gatherings in Dangerous Graphs.- Fun with Sub-linear Time Algorithms.- Wooden Geometric Puzzles: Design and Hardness Proofs.- HIROIMONO Is NP-Complete.- Tablatures for Stringed Instruments and Generating Functions.- Knitting for Fun: A Recursive Sweater.- Pictures from Mongolia - Partial Sorting in a Partial World.- Efficient Algorithms for the Spoonerism Problem.- High Spies (or How to Win a Programming Contest).- Robots and Demons (The Code of the Origins).- The Traveling Beams Optical Solutions for Bounded NP-Complete Problems.- The Worst Page-Replacement Policy.- Die Another Day.- Approximating Rational Numbers by Fractions.- Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles.- Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms.- The Troubles of Interior Design-A Complexity Analysis of the Game Heyawake.- Drawing Borders Efficiently.- The Ferry Cover Problem.- Web Marshals Fighting Curly Link Farms.- Intruder Capture in Sierpi?ski Graphs.- On the Complexity of the Traffic Grooming Problem in Optical Networks.
