LEADER 05020nam 2200637 450 001 996466272103316 005 20230921170644.0 010 $a1-280-94435-8 010 $a9786610944354 010 $a3-540-72870-8 024 7 $a10.1007/978-3-540-72870-2 035 $a(CKB)1000000000478507 035 $a(EBL)3061563 035 $a(SSID)ssj0000101070 035 $a(PQKBManifestationID)11131455 035 $a(PQKBTitleCode)TC0000101070 035 $a(PQKBWorkID)10037700 035 $a(PQKB)10950298 035 $a(DE-He213)978-3-540-72870-2 035 $a(MiAaPQ)EBC3061563 035 $a(MiAaPQ)EBC6742770 035 $a(Au-PeEL)EBL6742770 035 $a(OCoLC)184904688 035 $a(PPN)123162726 035 $a(EXLCZ)991000000000478507 100 $a20220629d2007 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aAlgorithmic aspects in information and management $ethird international conference, AAIM 2007, Portland, or, USA, June 6-8, 2007, proceedings /$fMing-Yang Kao, Xiang-Yang Li, editors 205 $a1st ed. 2007. 210 1$aBerlin ;$aHeidelberg :$cSpringer-Verlag,$d[2007] 210 4$dİ2007 215 $a1 online resource (438 p.) 225 1 $aLecture Notes in Computer Science ;$v4508 300 $aDescription based upon print version of record. 311 $a3-540-72868-6 320 $aIncludes bibliographical references and index. 327 $aContributed 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. 410 0$aLecture notes in computer science ;$v4508. 606 $aComputer algorithms$vCongresses 606 $aManagement science$xMathematical models$vCongresses 615 0$aComputer algorithms 615 0$aManagement science$xMathematical models 676 $a005.1 702 $aKao$b Ming-Yang 702 $aLi$b Xiangyang 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466272103316 996 $aAlgorithmic Aspects in Information and Management$9771920 997 $aUNISA