Skip to main content
Springer Nature Link
Log in

Algorithms and Computation

8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings

  • Conference proceedings
  • © 2014

Overview

Editors:
  1. Sudebkumar Prasant Pal

    1. Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, Kharagpur, India

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Kunihiko Sadakane

    1. National Institute of Informatics, Chiyoda-ku, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Included in the following conference series:

Conference proceedings info: WALCOM 2014.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
Â¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This book constitutes the revised selected papers of the 8th International Workshop on Algorithms and Computation, WALCOM 2014, held in Chennai, India, in February 2014. The 29 full papers presented together with 3 invited talks were carefully reviewed and selected from 62 submissions. The papers are organized in topical sections on computational geometry, algorithms and approximations, distributed computing and networks, graph algorithms, complexity and bounds, and graph embeddings and drawings.

Similar content being viewed by others

Keywords

Table of contents (32 papers)

  1. Front Matter

    Pages I-XIV
    Download chapter PDF

  2. Invited Papers

    1. Algorithms for Equilibrium Prices in Linear Market Models

      • Kurt Mehlhorn
      Pages 1-4

    2. In as Few Comparisons as Possible

      • J. Ian Munro
      Pages 5-6

    3. The Happy End Theorem and Related Results

      • Pavel Valtr
      Pages 7-7

  3. Computational Geometry

    1. Generalized Class Cover Problem with Axis-Parallel Strips

      • Apurva Mudgal, Supantha Pandit
      Pages 8-21

    2. Top-k Manhattan Spatial Skyline Queries

      • Wanbin Son, Fabian Stehn, Christian Knauer, Hee-Kap Ahn
      Pages 22-33

    3. On Generalized Planar Skyline and Convex Hull Range Queries

      • Nadeem Moidu, Jatin Agarwal, Sankalp Khare, Kishore Kothapalli, Kannan Srinathan
      Pages 34-43

    4. Boundary Labeling with Flexible Label Positions

      • Zhi-Dong Huang, Sheung-Hung Poon, Chun-Cheng Lin
      Pages 44-55

  4. Algorithms and Approximations

    1. Approximating the Bipartite TSP and Its Biased Generalization

      • Aleksandar Shurbevski, Hiroshi Nagamochi, Yoshiyuki Karuno
      Pages 56-67

    2. A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow

      • Jean-François Baffier, Vorapong Suppakitpaisarn
      Pages 68-79

    3. Simple Linear Comparison of Strings in V-Order

      • Ali Alatabbi, Jackie Daykin, M. Sohel Rahman, William F. Smyth
      Pages 80-89

    4. SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search

      • Nils Kriege, Petra Mutzel, Till Schäfer
      Pages 90-101

  5. Distributed Computing and Networks

    1. Optimal Serial Broadcast of Successive Chunks

      • Satoshi Fujita
      Pages 102-113

    2. The \({\mathcal{G}}\)-Packing with t-Overlap Problem

      • Jazmín Romero, Alejandro López-Ortiz
      Pages 114-124

    3. Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity

      • Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh
      Pages 125-137

    4. On a Class of Covering Problems with Variable Capacities in Wireless Networks

      • Selim Akl, Robert Benkoczi, Daya Ram Gaur, Hossam Hassanein, Shahadat Hossain, Mark Thom
      Pages 138-150

  6. Graph Algorithms

    1. Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs

      • B. S. Panda, Arti Pandey
      Pages 151-162

    2. Some Results on Point Visibility Graphs

      • Subir Kumar Ghosh, Bodhayan Roy
      Pages 163-175

    3. Some Extensions of the Bottleneck Paths Problem

      • Tong-Wook Shinn, Tadao Takaoka
      Pages 176-187

    4. I/O Efficient Algorithms for the Minimum Cut Problem on Unweighted Undirected Graphs

      • Alka Bhushan, G. Sajith
      Pages 188-199
Back to top

Other volumes

  1. Algorithms and Computation

Editors and Affiliations

  • Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, Kharagpur, India

    Sudebkumar Prasant Pal

  • National Institute of Informatics, Chiyoda-ku, Japan

    Kunihiko Sadakane

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation