E-Book, Englisch, 281 Seiten
Crescenzi / Prencipe / Pucci Fun with Algorithms
2007
ISBN: 978-3-540-72914-3
Verlag: Springer Berlin Heidelberg
Format: PDF
Kopierschutz: 1 - PDF Watermark
4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings
E-Book, Englisch, 281 Seiten
Reihe: Theoretical Computer Science and General Issues
ISBN: 978-3-540-72914-3
Verlag: Springer Berlin Heidelberg
Format: PDF
Kopierschutz: 1 - PDF Watermark
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.
Autoren/Hrsg.
Weitere Infos & Material
1;Preface;5
2;Conference Organization;6
3;Table of Contents;8
4;On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features;10
5;Close Encounters with a Black Hole or Explorations and Gatherings in Dangerous Graphs;23
6;Fun with Sub-linear Time Algorithms;24
7;Wooden Geometric Puzzles: Design and Hardness Proofs;25
8;HIROIMONO Is NP-Complete;39
9;Tablatures for Stringed Instruments and Generating Functions;49
10;Knitting for Fun: A Recursive Sweater;62
11;Pictures from Mongolia – Partial Sorting in a PartialWorld;75
12;Efficient Algorithms for the Spoonerism Problem;87
13;High Spies (or How to Win a Programming Contest);102
14;Robots and Demons (The Code of the Origins);117
15;The Traveling Beams Optical Solutions for Bounded NP-Complete Problems (Extended Abstract);129
16;The Worst Page-Replacement Policy;144
17;Die Another Day;155
18;Approximating Rational Numbers by Fractions;165
19;Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles;175
20;Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms;192
21;The Troubles of Interior Design–A Complexity Analysis of the Game Heyawake;207
22;Drawing Borders Efficiently;222
23;The Ferry Cover Problem;236
24;Web Marshals Fighting Curly Link Farms;249
25;Intruder Capture in Sierpi ´nski Graphs;258
26;On the Complexity of the Traffic Grooming Problem in Optical Networks (Extended Abstract);271
27;Author Index;281
