000 04462nam a22005535i 4500
001 978-3-642-14355-7
003 DE-He213
005 20140220084542.0
007 cr nn 008mamaa
008 100626s2010 gw | s |||| 0|eng d
020 _a9783642143557
_9978-3-642-14355-7
024 7 _a10.1007/978-3-642-14355-7
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
100 1 _aChen, Bo.
_eeditor.
245 1 0 _aAlgorithmic Aspects in Information and Management
_h[electronic resource] :
_b6th International Conference, AAIM 2010, Weihai, China, July 19-21, 2010. Proceedings /
_cedited by Bo Chen.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aXI, 336p. 51 illus.
_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 ;
_v6124
505 0 _aComparison 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.
520 _aThis volume constitutes the proceedings of the International Conference on Algorithmic Aspects in Information and Management, AAIM 2010, held in Weihai, China, in July 2010.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aComputer software.
650 0 _aComputational complexity.
650 0 _aArtificial intelligence.
650 0 _aInformation Systems.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aManagement of Computing and Information Systems.
650 2 4 _aData Structures.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aMathematics of Computing.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642143540
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6124
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-14355-7
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c112458
_d112458