Algorithmic Aspects in Information and Management 6th International Conference, AAIM 2010, Weihai, China, July 19-21, 2010. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Chen, Bo (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
• Σειρά: Lecture Notes in Computer Science, 6124
• Θέματα: Computer science.; Software engineering.; Computer programming.; Computers.; Algorithms.; Computer science > Mathematics.; Management information systems.; Computer Science.; Software Engineering/Programming and Operating Systems.; Programming Techniques.; Theory of Computation.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Management of Computing and Information Systems.

 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. 

 Comparison of Two Algorithms for Computing Page Importance -- The Invisible Hand for Risk Averse Investment in Electricity Generation -- Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data -- The (K,k)-Capacitated Spanning Tree Problem -- Optimal Algorithms for the Economic Lot-Sizing Problem with Multi-supplier -- Synthetic Road Networks -- Computing Exact and Approximate Nash Equilibria in 2-Player Games -- Where Would Refinancing Preferences Go? -- Approximating Maximum Edge 2-Coloring in Simple Graphs -- A Linear Kernel for Co-Path/Cycle Packing -- A VaR Algorithm for Warrants Portfolio -- Some Results on Incremental Vertex Cover Problem -- Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction -- Point Location in the Continuous-Time Moving Network -- Coordinated Scheduling of Production and Delivery with Production Window and Delivery Capacity Constraints -- Inverse 1-median Problem on Trees under Weighted l ??? Norm -- On the Approximability of the Vertex Cover and Related Problems -- Feasibility Testing for Dial-a-Ride Problems -- Indexing Similar DNA Sequences -- Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint -- A New Smoothing Newton Method for Symmetric Cone Complementarity Problems -- Approximation Algorithms for Scheduling with a Variable Machine Maintenance -- Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines -- Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles -- Randomized Approaches for Nearest Neighbor Search in Metric Space When Computing the Pairwise Distance Is Extremely Expensive -- A Primal-Dual Approximation Algorithm for the k-Level Stochastic Facility Location Problem -- Optimal Semi-online Scheduling Algorithms on Two Parallel Identical Machines under a Grade of Service Provision -- Varieties of Regularities in Weighted Sequences -- Online Uniformly Inserting Points on Grid -- Kernelization for Cycle Transversal Problems -- Online Splitting Interval Scheduling on m Identical Machines -- Extended Tabu Search on Fuzzy Traveling Salesman Problem in Multi-criteria Analysis -- Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery.