Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers

  • Editors
  • Bo Chen
  • Mike Paterson
  • Guochuan Zhang
Conference proceedings ESCAPE 2007

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4614)

Table of contents

  1. Front Matter
    PDF
  2. The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
    György Dósa
    Pages 1-11
  3. Sequential Vector Packing
    Mark Cieliebak, Alexander Hall, Riko Jacob, Marc Nunkesser
    Pages 12-23
  4. A Tighter Analysis of Set Cover Greedy Algorithm for Test Set
    Peng Cui
    Pages 24-35
  5. A More Effective Linear Kernelization for Cluster Editing
    Jiong Guo
    Pages 36-47
  6. CR-precis: A Deterministic Summary Structure for Update Data Streams
    Sumit Ganguly, Anirban Majumder
    Pages 48-59
  7. An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning
    Lingyu Sun, Ming Leng
    Pages 60-69
  8. On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems
    Peng Zhang, Wenbo Zhao
    Pages 70-81
  9. A Digital Watermarking Scheme Based on Singular Value Decomposition
    Chin-Chen Chang, Yih-Shin Hu, Chia-Chen Lin
    Pages 82-93
  10. A New (t,n) −Threshold Scheme Based on Difference Equations
    Chao-Wen Chan, Chin-Chen Chang
    Pages 94-106
  11. Clique-Transversal Sets in Cubic Graphs
    Zuosong Liang, Erfang Shan, T. C. E. Cheng
    Pages 107-115
  12. On the L(h,k)-Labeling of Co-comparability Graphs
    Tiziana Calamoneri, Saverio Caminiti, Stephan Olariu, Rossella Petreschi
    Pages 116-127
  13. An Approximation Algorithm for the General Mixed Packing and Covering Problem
    Florian Diedrich, Klaus Jansen
    Pages 128-139
  14. Extending the Hardness of RNA Secondary Structure Comparison
    Guillaume Blin, Guillaume Fertin, Irena Rusu, Christine Sinoquet
    Pages 140-151
  15. On the On-Line Weighted k-Taxi Problem
    Weimin Ma, Ke Wang
    Pages 152-162
  16. Model Futility and Dynamic Boundaries with Application in Banking Default Risk Modeling
    Xiao Jun Shi
    Pages 163-174
  17. On the Minimum Risk-Sum Path Problem
    Xujin Chen, Jie Hu, Xiaodong Hu
    Pages 175-185
  18. Constrained Cycle Covers in Halin Graphs
    Yueping Li
    Pages 186-197
  19. Optimal Semi-online Algorithms for Scheduling with Machine Activation Cost
    Shuguang Han, Yiwei Jiang, Jueliang Hu
    Pages 198-208
  20. A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection
    Wolfgang Bein, José R. Correa, Xin Han
    Pages 209-218

About these proceedings

Keywords

Microarray Multimedia algebraic computation algorithms complexity computational biology data compression dynamic programming financial data processing graph theory grid computing internet algorithms optimizatio optimization vertices

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-74450-4
  • Copyright Information Springer-Verlag Berlin Heidelberg 2007
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-74449-8
  • Online ISBN 978-3-540-74450-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site