000 04733nam a22005775i 4500
001 978-3-540-68880-8
003 DE-He213
005 20160624102052.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540688808
_9978-3-540-68880-8
024 7 _a10.1007/978-3-540-68880-8
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aAlgorithmic Aspects in Information and Management
_h[electronic resource] :
_b4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008. Proceedings /
_cedited by Rudolf Fleischer, Jinhui Xu.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
300 _aXI, 352 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5034
505 0 _aDouble Partition: (6?+??)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs -- Nash Bargaining Via Flexible Budget Markets -- On the Minimum Hitting Set of Bundles Problem -- Speed Scaling with a Solar Cell -- Engineering Label-Constrained Shortest-Path Algorithms -- New Upper Bounds on Continuous Tree Edge-Partition Problem -- A Meeting Scheduling Problem Respecting Time and Space -- Fixed-Parameter Algorithms for Kemeny Scores -- The Distributed Wireless Gathering Problem -- Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement -- An Improved Randomized Approximation Algorithm for Maximum Triangle Packing -- Line Facility Location in Weighted Regions -- Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems -- Engineering Comparators for Graph Clusterings -- On the Fast Searching Problem -- Confidently Cutting a Cake into Approximately Fair Pieces -- Copeland Voting Fully Resists Constructive Control -- The Complexity of Power-Index Comparison -- Facility Location Problems: A Parameterized View -- Shortest Path Queries in Polygonal Domains -- A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem -- Minimum Cost Homomorphism Dichotomy for Oriented Cycles -- Minimum Leaf Out-Branching Problems -- Graphs and Path Equilibria -- No l Grid-Points in Spaces of Small Dimension -- The Secret Santa Problem -- Finding Optimal Refueling Policies in Transportation Networks -- Scale Free Interval Graphs -- On Representation of Planar Graphs by Segments -- An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the ? p Norm -- An Optimal Strategy for Online Non-uniform Length Order Scheduling -- Large-Scale Parallel Collaborative Filtering for the Netflix Prize.
520 _aThis book constitutes the refereed proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management, AAIM 2008, held in Shanghai, China, in June 2008. The 30 revised full papers presented together with abstracts of 2 invited talks were carefully reviewed and selected from 53 submissions. The papers cover original algorithmic research on immediate applications and/or fundamental problems pertinent to information management and management science. Topics addressed are: approximation algorithms, geometric data management, biological data management, graph algorithms, computational finance, mechanism design, computational game theory, network optimization, data structures, operations research, discrete optimization, online algorithms, FPT algorithms, and scheduling algorithms.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aComputer software.
650 0 _aElectronic data processing.
650 0 _aComputational complexity.
650 0 _aIndustrial management.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aData Structures.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aNumeric Computing.
650 2 4 _aProbability and Statistics in Computer Science.
650 2 4 _aManagement/Business for Professionals.
700 1 _aFleischer, Rudolf.
_eeditor.
700 1 _aXu, Jinhui.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540688655
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5034
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-540-68880-8
942 _2EBK7086
_cEBK
999 _c36380
_d36380