• Algorithmic Aspects in Information and Management: Third International Conference, Aaim 2007, Portland, or, USA, June 6-8, 2007, Proceedings See large image

    Algorithmic Aspects in Information and Management: Third International Conference, Aaim 2007, Portland, or, USA, June 6-8, 2007, Proceedings (Lecture Notes in Computer Science) (Paperback) Volume editor Ming Yang Kao, Volume editor Xiang-Yang Li

    $84.48 - Save $25.31 23% off - RRP $109.79 Free delivery worldwide Available
    Dispatched in 3 business days
    When will my order arrive?
    Add to basket | Add to wishlist |

    DescriptionThis book constitutes the refereed proceedings of the Third International Conference on Algorithmic Aspects in Information and Management, AAIM 2007, held in Portland, OR, USA in June 2007. The 39 revised full papers presented together with abstracts of 3 invited talks were carefully reviewed and selected from 120 submissions. The papers are organized in topical sections on graph algorithms, combinatorics, scheduling, graph theory, network algorithms, game theory, option theory, computational geometry, graph theory and combinatorics, as well as networks and data.


Other books

Other people who viewed this bought | Other books in this category
Showing items 1 to 9 of 9

 

Reviews | Bibliographic data
  • Full bibliographic data for Algorithmic Aspects in Information and Management

    Title
    Algorithmic Aspects in Information and Management
    Subtitle
    Third International Conference, Aaim 2007, Portland, or, USA, June 6-8, 2007, Proceedings
    Authors and contributors
    Volume editor Ming Yang Kao, Volume editor Xiang-Yang Li
    Physical properties
    Format: Paperback
    Number of pages: 440
    Width: 155 mm
    Height: 235 mm
    Thickness: 26 mm
    Weight: 682 g
    Language
    English
    ISBN
    ISBN 13: 9783540728689
    ISBN 10: 3540728686
    Classifications

    BIC E4L: COM
    Nielsen BookScan Product Class 3: S10.2
    B&T Book Type: NF
    LC subject heading: ,
    B&T Modifier: Continuations: 02
    DC22: 004
    Warengruppen-Systematik des deutschen Buchhandels: 16320
    B&T Modifier: Region of Publication: 04
    B&T Modifier: Academic Level: 02
    LC subject heading:
    LC classification: QA
    LC subject heading:
    B&T General Subject: 227
    LC classification: QA76.9.D35
    DC22: 005.1
    B&T Approval Code: A93603600
    LC classification: QA76.9.M35
    B&T Merchandise Category: COM
    BISAC V2.8: COM014000
    Ingram Subject Code: XG
    Abridged Dewey: 005
    B&T Approval Code: A51230000
    BISAC V2.8: MAT008000
    B&T Approval Code: A51443500
    BISAC V2.8: MAT013000, COM051300, BUS041000
    LC classification: QA76.9.A43
    BISAC V2.8: MAT036000
    Libri: MICR3700, WEBS2200, ALGO6000
    B&T Modifier: Text Format: 35
    BIC subject category V2: UMG
    LC classification: QA75.5-76.95, QA276-280, QA297-299.4
    LC subject heading:
    LC classification: QA76.6-76.66
    Thema V1.0: UMG
    Illustrations note
    biography
    Publisher
    Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
    Imprint name
    Springer-Verlag Berlin and Heidelberg GmbH & Co. K
    Publication date
    01 July 2007
    Publication City/Country
    Berlin
    Table of contents
    Contributed Papers To AAIM 2007.- Solving Generalized Maximum Dispersion with Linear Programming.- Significance-Driven Graph Clustering.- An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs.- Digraph Strong Searching: Monotonicity and Complexity.- Algorithms for Counting 2-Sat Solutions and Colorings with Applications.- Collaborative Ranking: An Aggregation Algorithm for Individuals' Preference Estimation.- A Compact Encoding of Rectangular Drawings with Efficient Query Supports.- A New Efficient Algorithm for Computing the Longest Common Subsequence.- Scheduling a Flexible Batching Machine.- Global Search Method for Parallel Machine Scheduling.- Releasing and Scheduling of Lots in a Wafer Fab.- Mixed Criteria Packet Scheduling.- Efficient Algorithms for k-Disjoint Paths Problems on DAGs.- Acyclic Edge Colouring of Outerplanar Graphs.- Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract).- Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree.- An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths.- Online OVSF Code Assignment with Resource Augmentation.- Optimal Joint Rate and Power Allocation in CDMA Networks.- Suppressing Maximum Burst Size Throughout the Path with Non-work Conserving Schedulers.- How to Play the Majority Game with Liars.- On Satisfiability Games and the Power of Congestion Games.- The Complexity of Algorithms Computing Game Trees on Random Assignments.- An Efficient, and Fast Convergent Algorithm for Barrier Options.- An Ingenious, Piecewise Linear Interpolation Algorithm for Pricing Arithmetic Average Options.- Optimal Order Allocation with Discount Pricing.- Convex Hulls of Point-Sets and Non-uniform Hypergraphs.- Optimal st-Orientations for Plane Triangulations.- Minimum Spanning Tree with Neighborhoods.- An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem.- Optimal Field Splitting with Feathering in Intensity-Modulated Radiation Therapy.- Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs.- BMA *: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps.- Strip Packing vs. Bin Packing.- Probe Matrix Problems: Totally Balanced Matrices.- Efficiency of Data Distribution in BitTorrent-Like Systems.- Design of a Fuzzy PI Controller to Guarantee Proportional Delay Differentiation on Web Servers.- Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots.- A Heuristic Method for Selecting Support Features from Large Datasets.- Invited Lecture.- Game and Market Equilibria: Computation, Approximation, and Smoothed Analysis.- Ad Auctions - Current and Future Research.- Expressive Commerce and Its Application to Sourcing: How We Conducted $25 Billion of Generalized Combinatorial Auctions.