Skip to main content
  • Conference proceedings
  • © 2010

Algorithms and Computation

21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): ISAAC: International Symposium on Algorithms and Computation

Conference proceedings info: ISAAC 2010.

Buying options

eBook USD 84.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (39 papers)

  1. Front Matter

  2. Session 6A. Data Structure and Algorithm II

    1. D2-Tree: A New Overlay with Deterministic Bounds

      • Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos Zaroliagis
      Pages 1-12
    2. Dynamic Range Reporting in External Memory

      • Yakov Nekrich
      Pages 25-36
    3. A Cache-Oblivious Implicit Dictionary with the Working Set Property

      • Gerth Stølting Brodal, Casper Kejlberg-Rasmussen, Jakob Truelsen
      Pages 37-48
  3. Session 6B. Graph Algorithm II

    1. The (p,q)-total Labeling Problem for Trees

      • Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
      Pages 49-60
    2. Drawing a Tree as a Minimum Spanning Tree Approximation

      • Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer
      Pages 61-72
    3. k-cyclic Orientations of Graphs

      • Yasuaki Kobayashi, Yuichiro Miyamoto, Hisao Tamaki
      Pages 73-84
  4. Session 7A. Computational Geometry II

    1. Maximum Overlap of Convex Polytopes under Translation

      • Hee-Kap Ahn, Siu-Wing Cheng, Iris Reinbacher
      Pages 97-108
    2. Approximate Shortest Homotopic Paths in Weighted Regions

      • Siu-Wing Cheng, Jiongxin Jin, Antoine Vigneron, Yajun Wang
      Pages 109-120
    3. Spanning Ratio and Maximum Detour of Rectilinear Paths in the L 1 Plane

      • Ansgar Grüne, Tien-Ching Lin, Teng-Kai Yu, Rolf Klein, Elmar Langetepe, D. T. Lee et al.
      Pages 121-131
  5. Session 7B. Graph Coloring II

    1. On Coloring Graphs without Induced Forests

      • Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
      Pages 156-167
  6. Session 8A. Approximation Algorithm II

    1. On the Approximability of the Maximum Interval Constrained Coloring Problem

      • Stefan Canzar, Khaled Elbassioni, Amr Elmasry, Rajiv Raman
      Pages 168-179
    2. Approximability of Constrained LCS

      • Minghui Jiang
      Pages 180-191
    3. Approximation Algorithms for the Multi-Vehicle Scheduling Problem

      • Binay Bhattacharya, Yuzhuang Hu
      Pages 192-205
    4. On Greedy Algorithms for Decision Trees

      • Ferdinando Cicalese, Tobias Jacobs, Eduardo Laber, Marco Molinaro
      Pages 206-217
  7. Session 8B. Online Algorithm

    1. Single and Multiple Device DSA Problem, Complexities and Online Algorithms

      • Weiwei Wu, Wanyong Tian, Minming Li, Chun Jason Xue, Enhong Chen
      Pages 218-229

Other Volumes

  1. Algorithms and Computation

Keywords

  • AAC
  • algorithms
  • combinatorial optimization
  • complexity
  • computational geometry
  • data structure
  • scheduling
  • algorithm analysis and problem complexity
  • data structures

Editors and Affiliations

  • Department of Computer Science, KAIST, Daejeon, Korea

    Otfried Cheong, Kyung-Yong Chwa

  • School of Computer Science and Engineering, Seoul National University, Seoul, Korea

    Kunsoo Park

Bibliographic Information

Buying options

eBook USD 84.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions