Skip to main content
  • Conference proceedings
  • © 2008

Frontiers in Algorithmics

Second International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceedings

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

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

Conference series link(s): FAW: International Workshop on Frontiers in Algorithmics

Conference proceedings info: FAW 2008.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
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 (35 papers)

  1. Front Matter

  2. A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance

    • Shuai Cheng Li, Yen Kaow Ng, Louxin Zhang
    Pages 35-44
  3. Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information

    • Seung-Ho Kang, In-Seon Jeong, Mun-Ho Choi, Hyeong-Seok Lim
    Pages 45-54
  4. Estimating Hybrid Frequency Moments of Data Streams

    • Sumit Ganguly, Mohit Bansal, Shruti Dube
    Pages 55-66
  5. Versioning Tree Structures by Path-Merging

    • Khaireel A. Mohamed, Tobias Langner, Thomas Ottmann
    Pages 101-112
  6. A Linear In-situ Algorithm for the Power of Cyclic Permutation

    • Jinyun Xue, Bo Yang, Zhengkang Zuo
    Pages 113-123
  7. Multi-bidding Strategy in Sponsored Keyword Auction

    • Tian-Ming Bu, Xiaotie Deng, Qi Qi
    Pages 124-134
  8. A CSP-Based Approach for Solving Parity Game

    • Min Jiang, Changle Zhou, Guoqing Wu, Fan Zhang
    Pages 135-146
  9. Characterizing and Computing Minimal Cograph Completions

    • Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos
    Pages 147-158
  10. Efficient First-Order Model-Checking Using Short Labels

    • Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté
    Pages 159-170
  11. Matching for Graphs of Bounded Degree

    • Yijie Han
    Pages 171-173

Other Volumes

  1. Frontiers in Algorithmics

About this book

The Annual International Frontiers in Algorithmics Workshop is a focused - rum on current trends in research on algorithms, discrete structures, and their applications. It intends to bring together international experts at the research frontiers in those areas to exchange ideas and to present signi?cant new results. The mission of the workshop is to stimulate the various ?elds for which al- rithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western algorithmics research communities. The Second Inter- tional Frontiers in Algorithmics Workshop (FAW 2008) took place in Changsha, China, June 19–21, 2008. In response to the Call for Papers, 80 papers were submitted from 15 co- tries and regions: Canada, China, France, Germany, Greece, Hong Kong, India, Iran, Japan, Mexico, Norway, Singapore, South Korea, Taiwan, and the USA. After a six-week period of careful reviewing and discussion, the Program C- mittee accepted 32 submissions for presentation at the conference. These papers were selected for nine special focus tracks in the areas of biomedical inform- ics, discrete structures, geometric information processing and communication, games and incentive analysis, graph algorithms, internet algorithms and pro- cols, parameterized algorithms, design and analysis of heuristics, approximate and online algorithms, and machine learning. The program of FAW 2008 also included three keynote talks by Xiaotie Deng, John E. Hopcroft, and Milan Sonka.

Keywords

  • Computer
  • Erfüllbarkeitsproblem der Aussagenlogik
  • Microarray
  • active learning
  • algorithms
  • approximation algorithms
  • clustering
  • complexity
  • data mining
  • formal verification
  • game theory
  • genetic algorithms
  • geometric informat
  • image analysis
  • verification
  • algorithm analysis and problem complexity

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
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