6. AAIM 2010: Weihai, China

• Yuting Liu, Zhiming Ma:
  Comparison of Two Algorithms for Computing Page Importance. 1-11
  
• Daniel Ralph, Yves Smeers:
  The Invisible Hand for Risk Averse Investment in Electricity Generation. 12
  
• Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, Xujin Chen, Xiaodong Hu, Bi Li:
  Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data. 13-24
  
• Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin:
  The (K, k)-Capacitated Spanning Tree Problem. 25-34
  
• Qing-Guo Bai, Jian-Teng Xu:
  Optimal Algorithms for the Economic Lot-Sizing Problem with Multi-supplier. 35-45
  
• Reinhard Bauer, Marcus Krug, Sascha Meinert, Dorothea Wagner:
  Synthetic Road Networks. 46-57
  
• Vittorio Bilò, Angelo Fanelli:
  Computing Exact and Approximate Nash Equilibria in 2-Player Games. 58-69
  
• Yajun Chai, Bo Liu:
  Where Would Refinancing Preferences Go? 70-77
  
• Zhi-Zhong Chen, Sayuri Konno, Yuki Matsushita:
  Approximating Maximum Edge 2-Coloring in Simple Graphs. 78-89
  
• Zhi-Zhong Chen, Michael R. Fellows, Bin Fu, Haitao Jiang, Yang Liu, Lusheng Wang, Binhai Zhu:
  A Linear Kernel for Co-Path/Cycle Packing. 90-102
  
• Jun Dai, Liyun Ni, Xiangrong Wang, Weizhong Chen:
  A VaR Algorithm for Warrants Portfolio. 103-111
  
• Wenqiang Dai:
  Some Results on Incremental Vertex Cover Problem. 112-118
  
• Christian Ernst, Changxing Dong, Gerold Jäger, Dirk Richter, Paul Molitor:
  Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction. 119-130
  
• Chenglin Fan, Jun Luo:
  Point Location in the Continuous-Time Moving Network. 131-140
  
• Bin Fu, Yumei Huo, Hairong Zhao:
  Coordinated Scheduling of Production and Delivery with Production Window and Delivery Capacity Constraints. 141-149
  
• Xiucui Guan, Binwu Zhang:
  Inverse 1-median Problem on Trees under Weighted l _INFINITY Norm. 150-160
  
• Qiaoming Han, Abraham P. Punnen:
  On the Approximability of the Vertex Cover and Related Problems. 161-169
  
• Dag Haugland, Sin C. Ho:
  Feasibility Testing for Dial-a-Ride Problems. 170-179
  
• Songbo Huang, Tak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Siu-Ming Yiu:
  Indexing Similar DNA Sequences. 180-190
  
• Ming Liu, Chengbin Chu, Yinfeng Xu, Lu Wang:
  Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint. 191-198
  
• Lixia Liu, Sanyang Liu:
  A New Smoothing Newton Method for Symmetric Cone Complementarity Problems. 199-208
  
• Wenchang Luo, Lin Chen, Guochuan Zhang:
  Approximation Algorithms for Scheduling with a Variable Machine Maintenance. 209-219
  
• Cuixia Miao, Yuzhong Zhang, Chengfei Wang:
  Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines. 220-228
  
• Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma:
  Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles. 229-242
  
• Lusheng Wang, Yong Yang, Guohui Lin:
  Randomized Approaches for Nearest Neighbor Search in Metric Space When Computing the Pairwise Distance Is Extremely Expensive. 243-252
  
• Zhen Wang, Donglei Du, Dachuan Xu:
  A Primal-Dual Approximation Algorithm for the k-Level Stochastic Facility Location Problem. 253-260
  
• Yong Wu, Qifan Yang:
  Optimal Semi-online Scheduling Algorithms on Two Parallel Identical Machines under a Grade of Service Provision. 261-270
  
• Hui Zhang, Qing Guo, Costas S. Iliopoulos:
  Varieties of Regularities in Weighted Sequences. 271-280
  
• Yong Zhang, Zhuo Chang, Francis Y. L. Chin, Hing-Fung Ting, Yung H. Tsin:
  Online Uniformly Inserting Points on Grid. 281-292
  
• Ge Xia, Yong Zhang:
  Kernelization for Cycle Transversal Problems. 293-303
  
• Feifeng Zheng, Bo Liu, Yinfeng Xu, E. Zhang:
  Online Splitting Interval Scheduling on m Identical Machines. 304-313
  
• Yujun Zheng:
  Extended Tabu Search on Fuzzy Traveling Salesman Problem in Multi-criteria Analysis. 314-324
  
• Binhai Zhu:
  Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery. 325-333
  

Last update Mon May 21 02:19:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page