Frontiers in Algorithmics: Second Annual International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceeedings

Xiaotie Deng (auth.), Franco P. Preparata, Xiaodong Wu, Jianping Yin (eds.)3540693106, 9783540693109

This book constitutes the refereed proceedings of the Second International Frontiers of Algorithmics Workshop, FAW 2008, held in Changsha, China, in June 2008.

The 33 revised full papers presented together with the abstracts of 3 invited talks were carefully reviewed and selected from 80 submissions. The papers were selected for 9 special focus tracks in the areas of biomedical informatics, discrete structures, geometric information processing and communication, games and incentive analysis, graph algorithms, internet algorithms and protocols, parameterized algorithms, design and analysis of heuristics, approximate and online algorithms, and machine learning.

Table of contents :
Front Matter….Pages –
Fixed Point Computation and Equilibrium….Pages 1-1
Computer Science in the Information Age….Pages 2-2
Knowledge-Based Approaches to Quantitative Medical Image Analysis and Image-Based Decision Making….Pages 3-3
Optimal Field Splitting, with Applications in Intensity-Modulated Radiation Therapy….Pages 4-15
A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem….Pages 16-27
SlopeMiner: An Improved Method for Mining Subtle Signals in Time Course Microarray Data….Pages 28-34
A PTAS for the k -Consensus Structures Problem Under Euclidean Squared Distance….Pages 35-44
Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information….Pages 45-54
Estimating Hybrid Frequency Moments of Data Streams….Pages 55-66
Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations….Pages 67-78
NP-Completeness of (k-SAT, r -UNk-SAT) and (LSAT  ≥ k , r -UNLSAT  ≥ k )….Pages 79-88
Absorbing Random Walks and the NAE2SAT Problem….Pages 89-100
Versioning Tree Structures by Path-Merging….Pages 101-112
A Linear In-situ Algorithm for the Power of Cyclic Permutation….Pages 113-123
Multi-bidding Strategy in Sponsored Keyword Auction….Pages 124-134
A CSP-Based Approach for Solving Parity Game….Pages 135-146
Characterizing and Computing Minimal Cograph Completions….Pages 147-158
Efficient First-Order Model-Checking Using Short Labels….Pages 159-170
Matching for Graphs of Bounded Degree….Pages 171-173
Searching Trees with Sources and Targets….Pages 174-185
Ranking of Closeness Centrality for Large-Scale Social Networks….Pages 186-195
Mixed Search Number of Permutation Graphs….Pages 196-207
The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs….Pages 208-220
A Distributed Algorithm to Approximate Node-Weighted Minimum α -Connected ( θ , k )-Coverage in Dense Sensor Networks….Pages 221-232
Optimal Surface Flattening….Pages 233-244
Visiting a Polygon on the Optimal Way to a Query Point….Pages 245-251
Constraint Abstraction in Verification of Security Protocols….Pages 252-263
Fast Convergence of Variable-Structure Congestion Control Protocol with Explicit Precise Feedback….Pages 264-275
Applying a New Grid-Based Elitist-Reserving Strategy to EMO Archive Algorithms….Pages 276-287
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants….Pages 288-299
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach….Pages 300-310
A Scalable Algorithm for Graph-Based Active Learning….Pages 311-322
A Supervised Feature Extraction Algorithm for Multi-class….Pages 323-329
An Incremental Feature Learning Algorithm Based on Least Square Support Vector Machine….Pages 330-338
A Novel Wavelet Image Fusion Algorithm Based on Chaotic Neural Network….Pages 339-348
Back Matter….Pages –