Skip to main content
  • Conference proceedings
  • © 2007

Algorithmic Aspects in Information and Management

Third International Conference, AAIM 2007, Portland, OR, USA, June 6-8, 2007, Proceedings

Conference proceedings info: AAIM 2007.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (42 papers)

  1. Front Matter

  2. Contributed Papers To AAIM 2007

    1. Session 1: Graph Algorithms

      1. Solving Generalized Maximum Dispersion with Linear Programming
        • Gerold Jäger, Anand Srivastav, Katja Wolf
        Pages 1-10
      2. Significance-Driven Graph Clustering
        • Marco Gaertler, Robert Görke, Dorothea Wagner
        Pages 11-26
    2. Session 2: Combinatorics

      1. Collaborative Ranking: An Aggregation Algorithm for Individuals’ Preference Estimation
        • Joachim Giesen, Dieter Mitsche, Eva Schuberth
        Pages 58-67
      2. A Compact Encoding of Rectangular Drawings with Efficient Query Supports
        • Katsuhisa Yamanaka, Shin-Ichi Nakano
        Pages 68-81
      3. A New Efficient Algorithm for Computing the Longest Common Subsequence
        • M. Sohel Rahman, Costas S. Iliopoulos
        Pages 82-90
    3. Session 3: Scheduling

      1. Scheduling a Flexible Batching Machine
        • Baoqiang Fan, Jianzhong Gu, Guochun Tang
        Pages 91-99
      2. Releasing and Scheduling of Lots in a Wafer Fab
        • Subhash C. Sarin, Vinod D. Shenai, Lixin Wang
        Pages 108-119
      3. Mixed Criteria Packet Scheduling
        • Chad R. Meiners, Eric Torng
        Pages 120-133
    4. Session 4: Graph Theory

      1. Efficient Algorithms for <i>k</i>-Disjoint Paths Problems on DAGs
        • Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
        Pages 134-143
      2. Acyclic Edge Colouring of Outerplanar Graphs
        • Rahul Muthu, N. Narayanan, C. R. Subramanian
        Pages 144-152
      3. Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract)
        • Pei-Chi Huang, Hsin-Wen Wei, Wan-Chen Lu, Wei-Kuan Shih, Tsan-sheng Hsu
        Pages 153-166
      4. Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
        • Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
        Pages 167-177
    5. Session 5: Newtork Algorithm

      1. Online OVSF Code Assignment with Resource Augmentation
        • Francis Y. L. Chin, Yong Zhang, Hong Zhu
        Pages 191-200
      2. Optimal Joint Rate and Power Allocation in CDMA Networks
        • Richard J. Boucherie, Aloysius Irwan Endrayanto, Adriana Felicia Gabor
        Pages 201-210

Other Volumes

  1. Algorithmic Aspects in Information and Management

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access