Skip to main content
Springer Nature Link
Log in

Frontiers in Algorithmics

Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009, Proceedings

  • Conference proceedings
  • © 2009

Overview

Editors:
  1. Xiaotie Deng

    1. Department of Computer Science,, City University of Hong Kong, Hong Kong, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. John E. Hopcroft

    1. Computer Science Department, Cornell University, Ithaca, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Jinyun Xue

    1. Provincial Key Laboratory of High-Performance Computing, Jiangxi Normal University, Nanchang, China

    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 5598)

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

Included in the following conference series:

Conference proceedings info: FAW 2009.

  • 38k Accesses

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

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • 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 refereed proceedings of the Third International Frontiers of Algorithmics Workshop, FAW 2009, held in Hefei, Anhui, China, in June 2009. The 33 revised full papers presented together with the abstracts of 3 invited talks were carefully reviewed and selected from 87 submissions. The papers are organized in topical sections on graph algorithms; game theory with applications; graph theory, computational geometry; machine learning; parameterized algorithms, heuristics and analysis; approximation algorithms; as well as pattern recognition algorithms, large scale data mining.

Similar content being viewed by others

Keywords

Table of contents (36 papers)

  1. Front Matter

    Download chapter PDF

  2. FAW 2009

    1. Invited Talks

      1. Study on Parallel Computing
        • Guoliang Chen
        Pages 1-1
      2. Communication Complexity and Its Applications
        • Andrew Chi-Chih Yao
        Pages 2-2
      3. Algorithmic Problems in Computer and Network Power Management
        • Frances F. Yao
        Pages 3-3

    2. Graph Algorithms

      1. Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains
        • Franz J. Brandenburg, Mao-cheng Cai
        Pages 4-15
      2. Edge Search Number of Cographs in Linear Time
        • Pinar Heggernes, Rodica Mihai
        Pages 16-26
      3. Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems
        • Changjing Wang, Jinyun Xue
        Pages 27-39
      4. Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs
        • Xiaofeng Gu, Kamesh Madduri, K. Subramani, Hong-Jian Lai
        Pages 40-50
      5. Covering-Based Routing Algorithms for Cyclic Content-Based P/S System
        • Chen Mingwen, Hu Songlin, Liu Zhiyong
        Pages 51-62

    3. Game Theory with Applications

      1. On the <i>α</i>-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games
        • Wei Chen, Shang-Hua Teng, Yajun Wang, Yuan Zhou
        Pages 63-73
      2. Cop-Robber Guarding Game with Cycle Robber Region
        • Hiroshi Nagamochi
        Pages 74-84
      3. Covered Interest Arbitrage in Exchange Rate Forecasting Markets
        • Feng Wang, Yuanxiang Li, Cheng Yang
        Pages 85-96

    4. Graph Theory, Computational Geometry I

      1. CFI Construction and Balanced Graphs
        • Xiang Zhou
        Pages 97-107
      2. Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions
        • Christian Knauer, Klaus Kriegel, Fabian Stehn
        Pages 108-119
      3. Space–Query-Time Tradeoff for Computing the Visibility Polygon
        • Mostafa Nouri, Mohammad Ghodsi
        Pages 120-131
      4. Square and Rectangle Covering with Outliers
        • Hee-Kap Ahn, Sang Won Bae, Sang-Sub Kim, Matias Korman, Iris Reinbacher, Wanbin Son
        Pages 132-140

    5. Graph Theory, Computational Geometry II

      1. Processing an Offline Insertion-Query Sequence with Applications
        • Danny Z. Chen, Haitao Wang
        Pages 141-152
      2. Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
        • Mohammad Khairul Hasan, Sung-Eui Yoon, Kyung-Yong Chwa
        Pages 153-162
      3. On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs
        • Huaming Zhang
        Pages 163-172
      4. On Modulo Linked Graphs
        • Yuan Chen, Yao Mao, Qunjiao Zhang
        Pages 173-180
Back to top

Other volumes

  1. Frontiers in Algorithmics

Editors and Affiliations

  • Department of Computer Science,, City University of Hong Kong, Hong Kong, China

    Xiaotie Deng

  • Computer Science Department, Cornell University, Ithaca, USA

    John E. Hopcroft

  • Provincial Key Laboratory of High-Performance Computing, Jiangxi Normal University, Nanchang, China

    Jinyun Xue

Bibliographic Information

Publish with us

Policies and ethics

Back to top