Advertisement

Algorithms and Computation

22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings

  • Takao Asano
  • Shin-ichi Nakano
  • Yoshio Okamoto
  • Osamu Watanabe
Conference proceedings ISAAC 2011

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7074)

Table of contents

  1. Front Matter
    PDF

  2. Invited Talk I

    1. Algorithm Engineering for Route Planning – An Update –
      Dorothea Wagner
      Pages 1-5

  3. Invited Talk II

    1. Semidefinite Programming and Approximation Algorithms: A Survey
      Sanjeev Arora
      Pages 6-9

  4. Approximation Algorithms I

    1. The School Bus Problem on Trees
      Adrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità
      Pages 10-19
    2. Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph
      M. Reza Khani, Mohammad R. Salavatipour
      Pages 20-29
    3. Improved Approximation Algorithms for Routing Shop Scheduling
      Wei Yu, Guochuan Zhang
      Pages 30-39
    4. Contraction-Based Steiner Tree Approximations in Practice
      Markus Chimani, Matthias Woste
      Pages 40-49

  5. Computational Geometry I

    1. Covering and Piercing Disks with Two Centers
      Hee-Kap Ahn, Sang-Sub Kim, Christian Knauer, Lena Schlipf, Chan-Su Shin, Antoine Vigneron
      Pages 50-59
    2. Generating Realistic Roofs over a Rectilinear Polygon
      Hee-Kap Ahn, Sang Won Bae, Christian Knauer, Mira Lee, Chan-Su Shin, Antoine Vigneron
      Pages 60-69
    3. Computing the Visibility Polygon Using Few Variables
      Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira
      Pages 70-79
    4. Minimizing Interference in Ad-Hoc Networks with Bounded Communication Radius
      Matias Korman
      Pages 80-89

  6. Graph Algorithms

    1. Hamiltonian Paths in the Square of a Tree
      Jakub Radoszewski, Wojciech Rytter
      Pages 90-99
    2. Dominating Induced Matchings for P7-free Graphs in Linear Time
      Andreas Brandstädt, Raffaele Mosca
      Pages 100-109
    3. Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths
      Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van ’t Hof, Marcin Kamiński, Daniël Paulusma
      Pages 110-119
    4. Recognizing Polar Planar Graphs Using New Results for Monopolarity
      Van Bang Le, Ragnar Nevries
      Pages 120-129
    5. Robustness of Minimum Cost Arborescences
      Naoyuki Kamiyama
      Pages 130-139

  7. Data Structures I

    1. Path Queries in Weighted Trees
      Meng He, J. Ian Munro, Gelin Zhou
      Pages 140-149
    2. Dynamic Range Majority Data Structures
      Amr Elmasry, Meng He, J. Ian Munro, Patrick K. Nicholson
      Pages 150-159
    3. Dynamic Range Selection in Linear Space
      Meng He, J. Ian Munro, Patrick K. Nicholson
      Pages 160-169
    4. A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time
      Yakov Nekrich
      Pages 170-179
    5. Encoding 2D Range Maximum Queries
      Mordecai Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao
      Pages 180-189

  8. Distributed Systems

    1. Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
      Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer
      Pages 190-199
    2. Broadcasting in Heterogeneous Tree Networks with Uncertainty
      Cheng-Hsiao Tsou, Gen-Huey Chen, Ching-Chi Lin
      Pages 200-209
    3. Optimal File Distribution in Peer-to-Peer Networks
      Kai-Simon Goetzmann, Tobias Harks, Max Klimm, Konstantin Miller
      Pages 210-219

  9. Computational Geometry II

    1. Animal Testing
      Adrian Dumitrescu, Evan Hilscher
      Pages 220-229
    2. Cutting Out Polygons with a Circular Saw
      Adrian Dumitrescu, Masud Hasan
      Pages 230-239
    3. Fast Fréchet Queries
      Mark de Berg, Atlas F. Cook IV, Joachim Gudmundsson
      Pages 240-249

  10. Graph Drawing and Information Visualization

    1. Angle-Restricted Steiner Arborescences for Flow Map Layout
      Kevin Buchin, Bettina Speckmann, Kevin Verbeek
      Pages 250-259
    2. Treemaps with Bounded Aspect Ratio
      Mark de Berg, Bettina Speckmann, Vincent van der Weele
      Pages 260-270
    3. Simultaneous Embedding of Embedded Planar Graphs
      Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati
      Pages 271-280
    4. Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations
      Muhammad Jawaherul Alam, Therese Biedl, Stefan Felsner, Andreas Gerasch, Michael Kaufmann, Stephen G. Kobourov
      Pages 281-291

  11. Data Structures II

    1. Fully Retroactive Approximate Range and Nearest Neighbor Searching
      Michael T. Goodrich, Joseph A. Simons
      Pages 292-301
    2. Compact Representation of Posets
      Arash Farzan, Johannes Fischer
      Pages 302-311
    3. Explicit Array-Based Compact Data Structures for Triangulations
      Luca Castelli Aleardi, Olivier Devillers
      Pages 312-322
    4. Space-Efficient Data-Analysis Queries on Grids
      Gonzalo Navarro, Luís M. S. Russo
      Pages 323-332

  12. Parameterized Algorithms I

    1. A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments
      Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
      Pages 333-343
    2. Fixed-Parameter Complexity of Feedback Vertex Set in Bipartite Tournaments
      Sheng-Ying Hsiao
      Pages 344-353
    3. Parameterized Algorithms for Inclusion of Linear Matchings
      Sylvain Guillemot
      Pages 354-363
    4. Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem
      Chunhao Wang, Qian-Ping Gu
      Pages 364-373

  13. Parallel and External Memory Algorithms

    1. Sorting, Searching, and Simulation in the MapReduce Framework
      Michael T. Goodrich, Nodari Sitchinava, Qin Zhang
      Pages 374-383
    2. External-Memory Multimaps
      Elaine Angelino, Michael T. Goodrich, Michael Mitzenmacher, Justin Thaler
      Pages 384-394
    3. External Memory Orthogonal Range Reporting with Fast Updates
      Yakov Nekrich
      Pages 395-404
    4. Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization
      Jörg Lässig, Dirk Sudholt
      Pages 405-414

  14. Game Theory and Internet Algorithms

    1. Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs
      David Avis, Kazuo Iwama, Daichi Paku
      Pages 415-424
    2. Improved Collaborative Filtering
      Aviv Nisgav, Boaz Patt-Shamir
      Pages 425-434
    3. Asymptotic Modularity of Some Graph Classes
      Fabien de Montgolfier, Mauricio Soto, Laurent Viennot
      Pages 435-444

  15. Computational Complexity

    1. Program Size and Temperature in Self-Assembly
      Ho-Lin Chen, David Doty, Shinnosuke Seki
      Pages 445-453
    2. Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems
      Tomoyuki Yamakami
      Pages 454-463
    3. Lower Bounds for Myopic DPLL Algorithms with a Cut Heuristic
      Dmitry Itsykson, Dmitry Sokolov
      Pages 464-473

  16. Approximation Algorithms II

    1. Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane
      Ryuta Ando, Tomomi Matsui
      Pages 474-483

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 22nd International Symposium on Algorithms and Computation, ISAAC 2011, held in Yokohama, Japan in December 2011. The 76 revised full papers presented together with two invited talks were carefully reviewed and selected from 187 submissions for inclusion in the book. This volume contains topics such as approximation algorithms; computational geometry; computational biology; computational complexity; data structures; distributed systems; graph algorithms; graph drawing and information visualization; optimization; online and streaming algorithms; parallel and external memory algorithms; parameterized algorithms; game theory and internet algorithms; randomized algorithms; and string algorithms.

Keywords

distributed algorithm mesh data structures optimization space complexity vehicle routing

Editors and affiliations

  • Takao Asano
    • 1
  • Shin-ichi Nakano
    • 2
  • Yoshio Okamoto
    • 3
  • Osamu Watanabe
    • 4
  1. 1.Chuo UniversityTokyoJapan
  2. 2.Gunma UniversityKiryu-ShiJapan
  3. 3.Japan Advanced Institute of Science and TechnologyNomiJapan
  4. 4.Tokyo Institute of TechnologyTokyoJapan

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-25591-5
  • Copyright Information Springer-Verlag GmbH Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-25590-8
  • Online ISBN 978-3-642-25591-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Electronics
IT & Software
Telecommunications
Law
Engineering