Algorithmic Aspects in Information and Management

1. Front Matter

   PDF

2. Comparison of Two Algorithms for Computing Page Importance

   • Yuting Liu, Zhi-Ming Ma

   Pages 1-11

3. The Invisible Hand for Risk Averse Investment in Electricity Generation

   • Daniel Ralph, Yves Smeers

   Pages 12-12

4. Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data

   • E. Álvarez-Miranda, A. Candia, X. Chen, X. Hu, B. Li

   Pages 13-24

5. The (K,k)-Capacitated Spanning Tree Problem

   • Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin

   Pages 25-34

6. Optimal Algorithms for the Economic Lot-Sizing Problem with Multi-supplier

   • Qing-Guo Bai, Jian-Teng Xu

   Pages 35-45

7. Synthetic Road Networks

   • Reinhard Bauer, Marcus Krug, Sascha Meinert, Dorothea Wagner

   Pages 46-57

8. Computing Exact and Approximate Nash Equilibria in 2-Player Games

   • Vittorio Bilò, Angelo Fanelli

   Pages 58-69

9. Where Would Refinancing Preferences Go?

   • Yajun Chai, Bo Liu

   Pages 70-77

10. Approximating Maximum Edge 2-Coloring in Simple Graphs

    • Zhi-Zhong Chen, Sayuri Konno, Yuki Matsushita

    Pages 78-89

11. A Linear Kernel for Co-Path/Cycle Packing

    • Zhi-Zhong Chen, Michael Fellows, Bin Fu, Haitao Jiang, Yang Liu, Lusheng Wang et al.

    Pages 90-102

12. A VaR Algorithm for Warrants Portfolio

    • Jun Dai, Liyun Ni, Xiangrong Wang, Weizhong Chen

    Pages 103-111

13. Some Results on Incremental Vertex Cover Problem

    • Wenqiang Dai

    Pages 112-118

14. Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction

    • Christian Ernst, Changxing Dong, Gerold Jäger, Dirk Richter, Paul Molitor

    Pages 119-130

15. Point Location in the Continuous-Time Moving Network

    • Chenglin Fan, Jun Luo

    Pages 131-140

16. Coordinated Scheduling of Production and Delivery with Production Window and Delivery Capacity Constraints

    • Bin Fu, Yumei Huo, Hairong Zhao

    Pages 141-149

17. Inverse 1-median Problem on Trees under Weighted l _∞ Norm

    • Xiucui Guan, Binwu Zhang

    Pages 150-160

18. On the Approximability of the Vertex Cover and Related Problems

    • Qiaoming Han, Abraham P. Punnen

    Pages 161-169

19. Feasibility Testing for Dial-a-Ride Problems

    • Dag Haugland, Sin C. Ho

    Pages 170-179

20. Indexing Similar DNA Sequences

    • Songbo Huang, T. W. Lam, W. K. Sung, S. L. Tam, S. M. Yiu

    Pages 180-190

While the areas of information management and management science are full of algorithmic challenges, the proliferation of data has called for the design of e?cient and e?ective algorithms and data structures for their management and processing. The International Conference on Algorithmic Aspects in Information and Management(AAIM) is intended for originalalgorithmicresearchon immediate applications and/or fundamental problems pertinent to information mana- ment and management science to be broadly construed. The conference aims at bringing together researchers in computer science, operations research, applied mathematics, economics, and related disciplines. This volume contains papers presented at AAIM 2010: the 6th International Conference on Algorithmic Aspects in Information and Management, which was held during July 19-21, 2010, in Weihai, China. We received a total of 50 s- missions.Eachsubmissionwasreviewedbythreemembersof the ProgramC- mittee or their deputies on the quality, originality, soundness, and signi?cance of its contribution. The committee decided to accept 31 papers. The program also included two invited keynote talks. The success of the conference resulted from the input of many people. We would like ?rst of all to thank all the members of the Program Committee for their expert evaluation of the submissions. The local organizers in the School of Computer Science and Technology, Shandong University, did an extraordinary job, for which we are very grateful. We thank the National Natural Science Foundation of China, Montana State University (USA), University of Warwick (UK), and Shandong University (China) for their sponsorship.

• DNA matching
• algorithms
• artificial intelligence
• graph coloring
• nearest neighbour
• risk management
• road networks
• algorithm analysis and problem complexity

• Warwick Business School/ DIMAP - Centre for Discrete Mathematics and its Applications Coventry, University of Warwick, UK

  Bo Chen

Policies and ethics