Skip to main content
SpringerLink
Log in

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

Joint International Conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012, Proceedings

  • Conference proceedings
  • © 2012

Overview

Editors:
  1. Jack Snoeyink

    1. Department of Computer Science, University of North Carolina, Chapel Hill, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Pinyan Lu

    1. Microsoft Research Asia, Shanghai, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Kaile Su

    1. Peking University, Beijing, P.R.China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Lusheng Wang

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Fast-track conference proceedings State-of-the-art research Up-to-date results

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

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

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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

Table of contents (34 papers)

  1. Front Matter

    Download chapter PDF

  2. Optimal Binary Representation of Mosaic Floorplans and Baxter Permutations

    • Bryan He
    Pages 1-12

  3. Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs

    • Jiun-Jie Wang, Xin He
    Pages 13-25

  4. Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance

    • Longcheng Liu, Yong Chen, Biao Wu, Enyu Yao
    Pages 26-35

  5. Voronoi Diagram with Visual Restriction

    • Chenglin Fan, Jun Luo, Wencheng Wang, Binhai Zhu
    Pages 36-46

  6. Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region

    • Xuehou Tan, Bo Jiang
    Pages 47-57

  7. On Covering Points with Minimum Turns

    • Minghui Jiang
    Pages 58-69

  8. On Envy-Free Pareto Efficient Pricing

    • Xia Hua
    Pages 70-81

  9. Online Pricing for Multi-type of Items

    • Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting
    Pages 82-92

  10. Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines

    • Yiwei Jiang, Zewei Weng, Jueliang Hu
    Pages 93-104

  11. Computing Maximum Non-crossing Matching in Convex Bipartite Graphs

    • Danny Z. Chen, Xiaomin Liu, Haitao Wang
    Pages 105-116

  12. Algorithms for Bandwidth Consecutive Multicolorings of Graphs

    • Kazuhide Nishikawa, Takao Nishizeki, Xiao Zhou
    Pages 117-128

  13. Independent Domination on Tree Convex Bipartite Graphs

    • Yu Song, Tian Liu, Ke Xu
    Pages 129-138

  14. On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters

    • Deshi Ye, Lili Mei
    Pages 139-148

  15. On Multiprocessor Temperature-Aware Scheduling Problems

    • Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis, Ioannis Milis
    Pages 149-160

  16. Online Minimum Makespan Scheduling with a Buffer

    • Yan Lan, Xin Chen, Ning Ding, György Dósa, Xin Han
    Pages 161-171

  17. A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing

    • Richard Beigel, Bin Fu
    Pages 172-181

  18. Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP

    • Bin Fu
    Pages 182-191

  19. Some Remarks on the Incompressibility of Width-Parameterized SAT Instances

    • Bangsheng Tang
    Pages 192-198

  20. Kernels for Packing and Covering Problems

    • Jianer Chen, Henning Fernau, Peter Shaw, Jianxin Wang, Zhibiao Yang
    Pages 199-211
Back to top

Keywords

About this book

This book constitutes the refereed proceedings of the 6th International Frontiers of Algorithmics Workshop, FAW 2012, and the 8th International Conference on Algorithmic Aspects in Information and Management, AAIM 2012, jointly held in Beijing, China, in May 2012. The 33 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 81 submissions. The papers are organized in topical sections on algorithms and data structures, algorithmic game theory and incentive analysis, biomedical imaging algorithms, communication networks and optimization, computational learning theory, knowledge discovery, and data mining, experimental algorithmic methodologies, optimization algorithms in economic and operations research, pattern recognition algorithms and trustworthy algorithms and trustworthy software.

Editors and Affiliations

  • Department of Computer Science, University of North Carolina, Chapel Hill, USA

    Jack Snoeyink

  • Microsoft Research Asia, Shanghai, China

    Pinyan Lu

  • Peking University, Beijing, P.R.China

    Kaile Su

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

    Lusheng Wang

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation