My Account Log in

1 option

Algorithmic Aspects in Information and Management : 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008, Proceedings / edited by Rudolf Fleischer, Jinhui Xu.

SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online

View online
Format:
Book
Contributor:
Fleischer, Rudolf, 1964- editor.
Xu, Jinhui, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
LNCS sublibrary. Information systems and applications, incl. Internet/Web, and HCI ; SL 3, 5034.
Information Systems and Applications, incl. Internet/Web, and HCI ; 5034
Language:
English
Subjects (All):
Software engineering.
Algorithms.
Data structures (Computer science).
Computer science--Mathematics.
Computer science.
Numerical analysis.
Mathematical statistics.
Software Engineering/Programming and Operating Systems.
Algorithm Analysis and Problem Complexity.
Data Structures.
Discrete Mathematics in Computer Science.
Numeric Computing.
Probability and Statistics in Computer Science.
Local Subjects:
Software Engineering/Programming and Operating Systems.
Algorithm Analysis and Problem Complexity.
Data Structures.
Discrete Mathematics in Computer Science.
Numeric Computing.
Probability and Statistics in Computer Science.
Physical Description:
1 online resource (XI, 352 pages).
Edition:
First edition 2008.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
System Details:
text file PDF
Summary:
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.
Contents:
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.
Other Format:
Printed edition:
ISBN:
978-3-540-68880-8
9783540688808
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account