//]]>

Algorithmic Aspects in Information and Management (Record no. 13062)

000 -LEADER
fixed length control field 04303nam a22005175i 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20140310144050.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 100626s2010 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642143557
978-3-642-14355-7
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.A43
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
Edition number 23
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2010.
912 ## -
-- ZDB-2-SCS
-- ZDB-2-LNC
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Chen, Bo.
Relator term editor.
245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE
Title Algorithmic Aspects in Information and Management
Medium [electronic resource] :
Remainder of title 6th International Conference, AAIM 2010, Weihai, China, July 19-21, 2010. Proceedings /
Statement of responsibility, etc edited by Bo Chen.
300 ## - PHYSICAL DESCRIPTION
Extent XI, 336p. 51 illus.
Other physical details online resource.
440 1# - SERIES STATEMENT/ADDED ENTRY--TITLE
Title Lecture Notes in Computer Science,
International Standard Serial Number 0302-9743 ;
Volume number/sequential designation 6124
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note 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.
520 ## - SUMMARY, ETC.
Summary, etc This 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 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science.
Topical term or geographic name as entry element Data structures (Computer science).
Topical term or geographic name as entry element Computer software.
Topical term or geographic name as entry element Computational complexity.
Topical term or geographic name as entry element Artificial intelligence.
Topical term or geographic name as entry element Information Systems.
Topical term or geographic name as entry element Computer Science.
Topical term or geographic name as entry element Algorithm Analysis and Problem Complexity.
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
Topical term or geographic name as entry element Management of Computing and Information Systems.
Topical term or geographic name as entry element Data Structures.
Topical term or geographic name as entry element Artificial Intelligence (incl. Robotics).
Topical term or geographic name as entry element Mathematics of Computing.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783642143540
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-642-14355-7
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Item type E-Book
Copies
Price effective from Permanent location Date last seen Not for loan Date acquired Source of classification or shelving scheme Koha item type Damaged status Lost status Withdrawn status Current location Full call number
2014-03-29AUM Main Library2014-03-29 2014-03-29 E-Book   AUM Main Library005.1

Languages: 
English |
العربية