Cargando…

Algorithmic Aspects in Information and Management 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008, Proceedings /

This 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 selec...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Fleischer, Rudolf (Editor ), Xu, Jinhui (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
Edición:1st ed. 2008.
Colección:Information Systems and Applications, incl. Internet/Web, and HCI ; 5034
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-540-68880-8
003 DE-He213
005 20220115081021.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 |a 9783540688808  |9 978-3-540-68880-8 
024 7 |a 10.1007/978-3-540-68880-8  |2 doi 
050 4 |a QA76.758 
072 7 |a UMZ  |2 bicssc 
072 7 |a COM051230  |2 bisacsh 
072 7 |a UMZ  |2 thema 
082 0 4 |a 005.1  |2 23 
245 1 0 |a Algorithmic Aspects in Information and Management  |h [electronic resource] :  |b 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008, Proceedings /  |c edited by Rudolf Fleischer, Jinhui Xu. 
250 |a 1st ed. 2008. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2008. 
300 |a XI, 352 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Information Systems and Applications, incl. Internet/Web, and HCI ;  |v 5034 
505 0 |a Double 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 |a This 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 |a Software engineering. 
650 0 |a Algorithms. 
650 0 |a Artificial intelligence-Data processing. 
650 0 |a Computer science-Mathematics. 
650 0 |a Discrete mathematics. 
650 0 |a Numerical analysis. 
650 0 |a Mathematical statistics. 
650 1 4 |a Software Engineering. 
650 2 4 |a Algorithms. 
650 2 4 |a Data Science. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Numerical Analysis. 
650 2 4 |a Probability and Statistics in Computer Science. 
700 1 |a Fleischer, Rudolf.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Xu, Jinhui.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783540864592 
776 0 8 |i Printed edition:  |z 9783540688655 
830 0 |a Information Systems and Applications, incl. Internet/Web, and HCI ;  |v 5034 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-540-68880-8  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)