Advertisement

Computing and Combinatorics

11th Annual International Conference, COCOON 2005 Kunming, China, August 16–19, 2005 Proceedings

  • Lusheng Wang
Conference proceedings COCOON 2005

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

Table of contents

  1. Front Matter
    Pages I-XVI
    PDF

  2. Invited Lectures

    1. Completeness for Parity Problems
      Leslie G. Valiant
      Pages 1-8
    2. Monotony and Surprise
      Alberto Apostolico
      Pages 9-9
    3. Smoothed Analysis of Algorithms and Heuristics
      Shang-Hua Teng
      Pages 10-11

  3. Bioinformatics

    1. Gene Network: Model, Dynamics and Simulation
      Shiquan Wu, Xun Gu
      Pages 12-21
    2. Conserved Interval Distance Computation Between Non-trivial Genomes
      Guillaume Blin, Romeo Rizzi
      Pages 22-31
    3. RNA Multiple Structural Alignment with Longest Common Subsequences
      Sergey Bereg, Binhai Zhu
      Pages 32-41
    4. Perfect Sorting by Reversals
      Marie-France Sagot, Eric Tannier
      Pages 42-51
    5. Genome Rearrangements with Partially Ordered Chromosomes
      Chunfang Zheng, David Sankoff
      Pages 52-62
    6. Quartet-Based Phylogeny Reconstruction from Gene Orders
      Tao Liu, Jijun Tang, Bernard M. E. Moret
      Pages 63-73
    7. Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis
      Jinsong Tan, Kok Seng Chua, Louxin Zhang
      Pages 74-83
    8. RIATA-HGT: A Fast and Accurate Heuristic for Reconstructing Horizontal Gene Transfer
      Luay Nakhleh, Derek Ruths, Li-San Wang
      Pages 84-93
    9. A New Pseudoknots Folding Algorithm for RNA Structure Prediction
      Hengwu Li, Daming Zhu
      Pages 94-103
    10. Rapid Homology Search with Two-Stage Extension and Daughter Seeds
      Miklós Csűrös, Bin Ma
      Pages 104-114
    11. On the Approximation of Computing Evolutionary Trees
      Vincent Berry, Sylvain Guillemot, François Nicolas, Christophe Paul
      Pages 115-125

  4. Networks

    1. Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks
      Xiang-Yang Li, Peng-Jun Wan
      Pages 126-135
    2. Improved Approximation Algorithms for the Capacitated Multicast Routing Problem
      Zhipeng Cai, Guohui Lin, Guoliang Xue
      Pages 136-145
    3. Construction of Scale-Free Networks with Partial Information
      Jianyang Zeng, Wen-Jing Hsu, Suiping Zhou
      Pages 146-155
    4. Radio Networks with Reliable Communication
      Yvo Desmedt, Yongge Wang, Rei Safavi-Naini, Huaxiong Wang
      Pages 156-166
    5. Geometric Network Design with Selfish Agents
      Martin Hoefer, Piotr Krysta
      Pages 167-178
    6. Bicriteria Network Design via Iterative Rounding
      Piotr Krysta
      Pages 179-187
    7. Interference in Cellular Networks: The Minimum Membership Set Cover Problem
      Fabian Kuhn, Pascal von Rickenbach, Roger Wattenhofer, Emo Welzl, Aaron Zollinger
      Pages 188-198
    8. Routing and Coloring for Maximal Number of Trees
      Xujin Chen, Xiaodong Hu, Tianping Shuai
      Pages 199-209
    9. Share the Multicast Payment Fairly
      WeiZhao Wang, Xiang-Yang Li, Zheng Sun
      Pages 210-219
    10. On Packing and Coloring Hyperedges in a Cycle
      Jianping Li, Kang Li, Ken C. K. Law, Hao Zhao
      Pages 220-229
    11. Fault-Tolerant Relay Node Placement in Wireless Sensor Networks
      Hai Liu, Peng-Jun Wan, Xiaohua Jia
      Pages 230-239

  5. String Algorithms

    1. Best Fitting Fixed-Length Substring Patterns for a Set of Strings
      Hirotaka Ono, Yen Kaow Ng
      Pages 240-250
    2. String Coding of Trees with Locality and Heritability
      Saverio Caminiti, Rossella Petreschi
      Pages 251-262
    3. Finding Longest Increasing and Common Subsequences in Streaming Data
      David Liben-Nowell, Erik Vee, An Zhu
      Pages 263-272
    4. O(n2 log n) Time On-Line Construction of Two-Dimensional Suffix Trees
      Joong Chae Na, Raffaele Giancarlo, Kunsoo Park
      Pages 273-282

  6. Scheduling

    1. Min-Energy Voltage Allocation for Tree-Structured Tasks
      Minming Li, Becky Jie Liu, Frances F. Yao
      Pages 283-296
    2. Semi-online Problems on Identical Machines with Inexact Partial Information
      Zhiyi Tan, Yong He
      Pages 297-307
    3. On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules
      Fabien Baille, Evripidis Bampis, Christian Laforest, Nicolas Thibault
      Pages 308-317
    4. Off-Line Algorithms for Minimizing Total Flow Time in Broadcast Scheduling
      Wun-Tat Chan, Francis Y. L. Chin, Yong Zhang, Hong Zhu, Hong Shen, Prudence W. H. Wong
      Pages 318-328

  7. Complexity

    1. Oblivious and Adaptive Strategies for the Majority and Plurality Problems
      Fan Chung, Ron Graham, Jia Mao, Andrew Yao
      Pages 329-338
    2. A Note on Zero Error Algorithms Having Oracle Access to One NP Query
      Jin-Yi Cai, Venkatesan T. Chakaravarthy
      Pages 339-348
    3. On the Complexity of Computing the Logarithm and Square Root Functions on a Complex Domain
      Ker-I Ko, Fuxiang Yu
      Pages 349-358
    4. Solovay Reducibility on D-c.e Real Numbers
      Robert Rettinger, Xizhong Zheng
      Pages 359-368

  8. Steiner Trees

    1. Algorithms for Terminal Steiner Trees
      Fábio Viduani Martinez, José Coelho de Pina, José Soares
      Pages 369-379
    2. Simple Distributed Algorithms for Approximating Minimum Steiner Trees
      Parinya Chalermsook, Jittat Fakcharoenphol
      Pages 380-389
    3. A Truthful (2–2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals
      Luciano Gualà, Guido Proietti
      Pages 390-400

  9. Graph Drawing and Layout Design

    1. Radial Coordinate Assignment for Level Graphs
      Christian Bachmaier, Florian Fischer, Michael Forster
      Pages 401-410
    2. A Theoretical Upper Bound for IP-Based Floorplanning
      Guowu Yang, Xiaoyu Song, Hannah H. Yang, Fei Xie
      Pages 411-419

  10. Quantum Computing

    1. Quantum Noisy Rational Function Reconstruction
      Sean Hallgren, Alexander Russell, Igor E. Shparlinski
      Pages 420-429
    2. Promised and Distributed Quantum Search
      Shengyu Zhang
      Pages 430-439

  11. Randomized Algorithms

    1. Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence
      Fabien Viger, Matthieu Latapy
      Pages 440-449
    2. Randomized Quicksort and the Entropy of the Random Source
      Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler
      Pages 450-460
    3. Subquadratic Algorithm for Dynamic Shortest Distances
      Piotr Sankowski
      Pages 461-470
    4. Randomly Generating Triangulations of a Simple Polygon
      Q. Ding, J. Qian, W. Tsang, C. Wang
      Pages 471-480

  12. Geometry

    1. Triangulating a Convex Polygon with Small Number of Non-standard Bars
      Yinfeng Xu, Wenqiang Dai, Naoki Katoh, Makoto Ohsaki
      Pages 481-489

About these proceedings

Keywords

Computer Simulation Triangulation algorithmic geometry algorithms bioinformatics calculus combinatorial mathematics combinatorics complexity complexity theory computational complexity computational matematics distributed algorithms optimization

Editors and affiliations

  • Lusheng Wang
    • 1
  1. 1.Department of Computer ScienceCity University of Hong KongKowloonHong Kong

Bibliographic information

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