Algorithmic Aspects in Information and Management [electronic resource] : Third International Conference, AAIM 2007, Portland, OR, USA, June 6-8, 2007. Proceedings / edited by Ming-Yang Kao, Xiang-Yang Li.Material type: TextLanguage: English Series: Lecture Notes in Computer Science: 4508Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007Description: XII, 428 p. Also available online. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540728702Subject(s): Computer science | Data structures (Computer science) | Computer software | Electronic data processing | Computational complexity | Industrial management | Computer Science | Algorithm Analysis and Problem Complexity | Data Structures | Discrete Mathematics in Computer Science | Numeric Computing | Probability and Statistics in Computer Science | Management/Business for ProfessionalsAdditional physical formats: Printed edition:: No titleDDC classification: 005.1 LOC classification: QA76.9.A43Online resources: Click here to access online
Contributed Papers To AAIM 2007 -- Solving Generalized Maximum Dispersion with Linear Programming -- Significance-Driven Graph Clustering -- An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs -- Digraph Strong Searching: Monotonicity and Complexity -- Algorithms for Counting 2-Sat Solutions and Colorings with Applications -- Collaborative Ranking: An Aggregation Algorithm for Individuals’ Preference Estimation -- A Compact Encoding of Rectangular Drawings with Efficient Query Supports -- A New Efficient Algorithm for Computing the Longest Common Subsequence -- Scheduling a Flexible Batching Machine -- Global Search Method for Parallel Machine Scheduling -- Releasing and Scheduling of Lots in a Wafer Fab -- Mixed Criteria Packet Scheduling -- Efficient Algorithms for k-Disjoint Paths Problems on DAGs -- Acyclic Edge Colouring of Outerplanar Graphs -- Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract) -- Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree -- An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths -- Online OVSF Code Assignment with Resource Augmentation -- Optimal Joint Rate and Power Allocation in CDMA Networks -- Suppressing Maximum Burst Size Throughout the Path with Non-work Conserving Schedulers -- How to Play the Majority Game with Liars -- On Satisfiability Games and the Power of Congestion Games -- The Complexity of Algorithms Computing Game Trees on Random Assignments -- An Efficient, and Fast Convergent Algorithm for Barrier Options -- An Ingenious, Piecewise Linear Interpolation Algorithm for Pricing Arithmetic Average Options -- Optimal Order Allocation with Discount Pricing -- Convex Hulls of Point-Sets and Non-uniform Hypergraphs -- Optimal st-Orientations for Plane Triangulations -- Minimum Spanning Tree with Neighborhoods -- An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem -- Optimal Field Splitting with Feathering in Intensity-Modulated Radiation Therapy -- Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs -- BMA *: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps -- Strip Packing vs. Bin Packing -- Probe Matrix Problems: Totally Balanced Matrices -- Efficiency of Data Distribution in BitTorrent-Like Systems -- Design of a Fuzzy PI Controller to Guarantee Proportional Delay Differentiation on Web Servers -- Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots -- A Heuristic Method for Selecting Support Features from Large Datasets -- Invited Lecture -- Game and Market Equilibria: Computation, Approximation, and Smoothed Analysis -- Ad Auctions – Current and Future Research -- Expressive Commerce and Its Application to Sourcing: How We Conducted $25 Billion of Generalized Combinatorial Auctions.
The papers in this volume were presented at the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM 2007), held June 6–8, 2007 in Portland, Oregon, USA. This conference is intended for or- inal algorithmic research on immediate applications and/or fundamental pr- lems pertinent to information management and management science, broadly construed. Submissions to the conference this year were conducted electronically. A total of 120 papers were submitted, of which 40 were initially accepted, and 1 paper was withdrawed later. The papers were evaluated by an international ProgramCommittee consisting of Hee-Kap Ahn, Takao Asano, Amotz Bar-Noy, Hans Bodlaender, Peter Brucker, Leizhen Cai, Gruia Calinescu, Jianer Chen, Siu-Wing Cheng,MarekChrobak,Yang Dai, Rudolf Fleischer,Jie Gao,Joachim Gudmundsson, Bhaskar DasGupta, Gregory Gutin, Wen-Lian Hsu, Giuseppe F. Italiano, Ming-Yang Kao, Sanjiv Kapoor, Tak-Wah Lam, Erran Li Li, Jing Li, Xiang-YangLi,PeterBroMiltersen,Se?Naor,ChungKeungPoon,KirkPruhs, Rajeev Raman, Paul Spirakis, Zheng Sun, Wing Kin Sung, Jan van Leeuwen, Jie Wang, Lusheng Wang, Weizhao Wang, Yu Wang, JinHui Xu, Yinfeng Xu, and Binhai Zhu. The submitted papers to AAIM 2007 were from Algeria, Canada, Chile, China (mainland and Taiwan), Germany, Hong Kong, India, Italy, Japan, M- ico, Netherlands, Portugal, South Korea, Spain, Sweden, Switzerland, Turkey, Ukraine, UK, and USA.