Suchen und Finden
Service
Fun with Algorithms - 4th International Conference, Fun 2007, Castiglioncello, Italy
von: Pierluigi Crescenzi, Giuseppe Prencipe, Geppino Pucci (Eds.)
Springer-Verlag, 2007
ISBN: 9783540729143, 281 Seiten
Format: PDF, OL
Kopierschutz: DRM
Mehr zum Inhalt
Fun with Algorithms - 4th International Conference, Fun 2007, Castiglioncello, Italy
Preface
5
Conference Organization
6
Table of Contents
8
On Embedding a Graph in the Grid with the Maximum Number of Bends and Other Bad Features
10
Close Encounters with a Black Hole or Explorations and Gatherings in Dangerous Graphs
23
Fun with Sub-linear Time Algorithms
24
Wooden Geometric Puzzles: Design and Hardness Proofs
25
HIROIMONO Is NP-Complete
39
Tablatures for Stringed Instruments and Generating Functions
49
Knitting for Fun: A Recursive Sweater
62
Pictures from Mongolia – Partial Sorting in a PartialWorld
75
Efficient Algorithms for the Spoonerism Problem
87
High Spies (or How to Win a Programming Contest)
102
Robots and Demons (The Code of the Origins)
117
The Traveling Beams Optical Solutions for Bounded NP-Complete Problems (Extended Abstract)
129
The Worst Page-Replacement Policy
144
Die Another Day
155
Approximating Rational Numbers by Fractions
165
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles
175
Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms
192
The Troubles of Interior Design–A Complexity Analysis of the Game Heyawake
207
Drawing Borders Efficiently
222
The Ferry Cover Problem
236
Web Marshals Fighting Curly Link Farms
249
Intruder Capture in Sierpi ´nski Graphs
258
On the Complexity of the Traffic Grooming Problem in Optical Networks (Extended Abstract)
271
Author Index
281
Alle Preise verstehen sich inklusive der gesetzlichen MwSt.