会议专题

The 11th Annual International Computing and Combinatorics Conference COCOON 2005(第11届国际计算和组合会议)

总文献量: 97篇会议类型: 国际会议会议地点: 昆明主办单位: 中国运筹学会;中科院数学与系统科学研究院会议日期: 2005-08-01

文章浏览

Opportunistic Data Structures for Range Queries

Chung Keung Poon Wai Keung Yiu

Distributed Weighted Vertez Cover via Mazimal Matchings

Fabrizio Grandoni Jochen Konemann Alessandro Panconesi

Construction of Scale-Free Networks with Partial Information

Jianyang Zeng Wen-Jing Hsu Suiping Zhou

Gene Network: Model, Dynamics and Simulation

Shiquan Wu Xun Gu

Triangulating a Convez Polygon with Small Number of Non-standard Bars Eztended Abstract

Yinfeng Xu Wenqiang Dai Naoki Katoh Makoto Ohsaki

A Note on Zero Error Algorithms Having Oracle Access to One NP Query

Jin-Yi Cai Venkatesan T. Chakaravarthy

Distributions of Points in d Dimensions and Large k-Point Simplices Eztended Abstract

Hanno Lefmann

On-Line Simultaneous Mazimization of the Size and the Weight for Degradable Intervals Schedules

Fabien Bailie Evripidis Bampis Christian Laforest Nicolas Thibault

Efficient Algorithms for Intensity Map Splitting Problems in Radiation Therapy

Xiaodong Wu

On Approzimate Balanced Bi-clustering

Guoxuan Ma Jiming Peng Yu Wei

Interference in Cellular Networks: The Minimum Membership Set Cover Problem

Fabian Kuhn Pascal von Rickenbach Roger Wattenhofer Emo Welzl Aaron Zollinger

The Reverse Greedy Algorithm for the Metric K-Median Problem

Marek Chrobak Claire Kenyon Neal E. Young

RIATA-HGT: A Fast and Accurate Heuristic for Reconstructing Horizontal Gene Transfer

Luay Nakhleh Derek Ruths Li-San Wang

On the Complezity of the Balanced Vertez Ordering Problem

Jan Kara Jan Kratochvil David R. Wood

On the Power of Lookahead in On-Line Vehicle Routing Problems Eztended Abstract

Luca Allulli Giorgio Ausiello Luigi Laura

A Truthful (2-2/k)-Approzimation Mechanism for the Steiner Tree Problem with k Terminals

Luciano Guala Guido Proietti

On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs

Maw-Shang Chang Ton Kloks Dieter Kratsch Jiping Liu Sheng-Lung Peng

On Finding a Shortest Path in Circulant Graphs with Two Jumps

Domingo Gomez Jaime Gutierrez Alvar Ibeas Carmen Martinez Ramon Beivide

A Quadratic Lower Bound for Rocchios Similarity-Based Relevance Feedback Algorithm

Zhixiang Chen Bin Fu

Optimally Balanced Forward Degree Sequence

Xiaomin Chen Maxio Szegedy Lei Wang