Advertisement

Frontiers in Algorithmics

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

  • Xiaotie Deng
  • John E. Hopcroft
  • Jinyun Xue
Conference proceedings FAW 2009

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

Table of contents

  1. Front Matter
    PDF

  2. FAW 2009

    1. Invited Talks

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

    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 α-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
      5. Pathwidth is NP-Hard for Weighted Trees
        Rodica Mihai, Ioan Todinca
        Pages 181-195

    6. Machine Learning

      1. A Max-Margin Learning Algorithm with Additional Features
        Xinwang Liu, Jianping Yin, En Zhu, Yubin Zhan, Miaomiao Li, Changwang Zhang
        Pages 196-206
      2. DDoS Attack Detection Algorithm Using IP Address Features
        Jieren Cheng, Jianping Yin, Yun Liu, Zhiping Cai, Min Li
        Pages 207-215
      3. Learning with Sequential Minimal Transductive Support Vector Machine
        Xinjun Peng, Yifei Wang
        Pages 216-227
      4. Junction Tree Factored Particle Inference Algorithm for Multi-Agent Dynamic Influence Diagrams
        Hongliang Yao, Jian Chang, Caizi Jiang, Hao Wang
        Pages 228-236

    7. Parameterized Algorithms, Heuristics and Analysis

      1. An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set
        Jianxin Wang, Beiwei Chen, Qilong Feng, Jianer Chen
        Pages 237-250
      2. Heuristics for Mobile Object Tracking Problem in Wireless Sensor Networks
        Li Liu, Hao Li, Junling Wang, Lian Li, Caihong Li
        Pages 251-260
      3. Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
        Lusheng Wang, Binhai Zhu
        Pages 261-270
      4. The BDD-Based Dynamic A* Algorithm for Real-Time Replanning
        Yanyan Xu, Weiya Yue, Kaile Su
        Pages 271-282

    8. Approximation Algorithms

      1. Approximating Scheduling Machines with Capacity Constraints
        Chi Zhang, Gang Wang, Xiaoguang Liu, Jing Liu
        Pages 283-292
      2. Approximating the Spanning k-Tree Forest Problem
        Chung-Shou Liao, Louxin Zhang
        Pages 293-301
      3. Toward an Automatic Approach to Greedy Algorithms
        Yujun Zheng, Jinyun Xue, Zhengkang Zuo
        Pages 302-313
      4. A Novel Approximate Algorithm for Admission Control
        Jinghui Zhang, Junzhou Luo, Zhiang Wu
        Pages 314-325

    9. Pattern Recognition Algorithms, Large Scale Data Mining

      1. On the Structure of Consistent Partitions of Substring Set of a Word
        Meng Zhang, Yi Zhang, Liang Hu, Peichen Xin
        Pages 326-335
      2. A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
        Guomin Zhang, En Zhu, Ling Mao, Ming Yin
        Pages 336-345
      3. An Improved Database Classification Algorithm for Multi-database Mining
        Hong Li, XueGang Hu, YanMing Zhang
        Pages 346-357
      4. Six-Card Secure AND and Four-Card Secure XOR
        Takaaki Mizuki, Hideaki Sone
        Pages 358-369
  3. Back Matter
    PDF

About these proceedings

Introduction

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.

Keywords

Graph Graph theory algorithms cognition computational geometry data mining game theory heuristics machine learning pattern recognition

Editors and affiliations

  • Xiaotie Deng
    • 1
  • John E. Hopcroft
    • 2
  • Jinyun Xue
    • 3
  1. 1.Department of Computer Science,City University of Hong KongHong KongChina
  2. 2.Computer Science DepartmentCornell UniversityIthacaUSA
  3. 3.Provincial Key Laboratory of High-Performance ComputingJiangxi Normal UniversityNanchangChina

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-02270-8
  • Copyright Information Springer-Verlag Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-02269-2
  • Online ISBN 978-3-642-02270-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site