Skip to main content
  • Conference proceedings
  • © 2010

Frontiers in Algorithms

4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010, Proceedings

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

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 2010.

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 (31 papers)

  1. Front Matter

  2. Progress on Certifying Algorithms

    • Kurt Mehlhorn, Pascal Schweitzer
    Pages 1-5
  3. Computational Geometry for Uncertain Data

    • Mikhail J. Atallah
    Pages 6-6
  4. On Foundations of Services Interoperation in Cloud Computing

    • Deyi Li, Haisu Zhang, Yuchao Liu, Guishen Chen
    Pages 7-10
  5. Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets

    • Xiaotie Deng, Yang Sun, Ming Yin, Yunhong Zhou
    Pages 11-22
  6. Truthful Auction for CPU Time Slots

    • Qiang Zhang, Minming Li
    Pages 23-34
  7. Top-d Rank Aggregation in Web Meta-search Engine

    • Qizhi Fang, Han Xiao, Shanfeng Zhu
    Pages 35-44
  8. Minimum Common String Partition Revisited

    • Haitao Jiang, Binhai Zhu, Daming Zhu, Hong Zhu
    Pages 45-52
  9. Approximation Schemes for Scheduling with Availability Constraints

    • Bin Fu, Yumei Huo, Hairong Zhao
    Pages 77-88
  10. Improved Sublinear Time Algorithm for Width-Bounded Separators

    • Liang Ding, Bin Fu, Yunhui Fu
    Pages 101-112
  11. Constant Time Generation of Biconnected Rooted Plane Graphs

    • Bingbing Zhuang, Hiroshi Nagamochi
    Pages 113-123
  12. Solving General Lattice Puzzles

    • Gill Barequet, Shahar Tal
    Pages 124-135
  13. A Hybrid Graph Representation for Recursive Backtracking Algorithms

    • Faisal N. Abu-Khzam, Michael A. Langston, Amer E. Mouawad, Clinton P. Nolan
    Pages 136-147
  14. On Tractable Exponential Sums

    • Jin-Yi Cai, Xi Chen, Richard Lipton, Pinyan Lu
    Pages 148-159
  15. Approximation Algorithms for the Capacitated Domination Problem

    • Mong-Jen Kao, Han-Lin Chen
    Pages 185-196

Other Volumes

  1. Frontiers in Algorithmics

Keywords

  • Matchings
  • Partition
  • Scheduling
  • ad hoc networks
  • algorithm certifyication
  • algorithms
  • auction systems
  • cellular networks
  • cloud computing
  • computational geometry
  • convex hull
  • dead locks
  • design
  • geometry
  • graph coloring
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Academia Sinica, Institute of Information Science 20, Section 2, Taipei, Taiwan

    Der-Tsai Lee

  • Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, USA

    Danny Z. Chen

  • State Key Laboratory of Software Engineering, Wuhan University, Wuhan, China

    Shi Ying

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