Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

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

Editors:

ISBN: 978-3-540-74449-8 (Print) 978-3-540-74450-4 (Online)

Table of contents (46 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-11

    The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9

  3. No Access

    Book Chapter

    Pages 12-23

    Sequential Vector Packing

  4. No Access

    Book Chapter

    Pages 24-35

    A Tighter Analysis of Set Cover Greedy Algorithm for Test Set

  5. No Access

    Book Chapter

    Pages 36-47

    A More Effective Linear Kernelization for Cluster Editing

  6. No Access

    Book Chapter

    Pages 48-59

    CR-precis: A Deterministic Summary Structure for Update Data Streams

  7. No Access

    Book Chapter

    Pages 60-69

    An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning

  8. No Access

    Book Chapter

    Pages 70-81

    On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems

  9. No Access

    Book Chapter

    Pages 82-93

    A Digital Watermarking Scheme Based on Singular Value Decomposition

  10. No Access

    Book Chapter

    Pages 94-106

    A New (t,n) −Threshold Scheme Based on Difference Equations

  11. No Access

    Book Chapter

    Pages 107-115

    Clique-Transversal Sets in Cubic Graphs

  12. No Access

    Book Chapter

    Pages 116-127

    On the L(h,k)-Labeling of Co-comparability Graphs

  13. No Access

    Book Chapter

    Pages 128-139

    An Approximation Algorithm for the General Mixed Packing and Covering Problem

  14. No Access

    Book Chapter

    Pages 140-151

    Extending the Hardness of RNA Secondary Structure Comparison

  15. No Access

    Book Chapter

    Pages 152-162

    On the On-Line Weighted k-Taxi Problem

  16. No Access

    Book Chapter

    Pages 163-174

    Model Futility and Dynamic Boundaries with Application in Banking Default Risk Modeling

  17. No Access

    Book Chapter

    Pages 175-185

    On the Minimum Risk-Sum Path Problem

  18. No Access

    Book Chapter

    Pages 186-197

    Constrained Cycle Covers in Halin Graphs

  19. No Access

    Book Chapter

    Pages 198-208

    Optimal Semi-online Algorithms for Scheduling with Machine Activation Cost

  20. No Access

    Book Chapter

    Pages 209-218

    A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection

  21. No Access

    Book Chapter

    Pages 219-230

    Online Coupon Consumption Problem

previous Page of 3