|
Preliminary Program
(Posted on May 31, 2009; Subject to Change)
Registration Day of June 9
At the lobby |
14:00-19:00 |
Registration Package: Bags, Proceedings, badges, programs, notebooks, ball pens, receipts of registration fee, reception/lunch/banquet/tour tickets, local maps |
Morning Sessions of June 10
Sessions/Chairs/Time |
Titles of Talks / Speakers and Authors |
Plenary
session
Xiaodong Hu |
09:00-10:00 |
Optimization Problems in Under Water Sensor Networks
Ding-Zhu Du |
Tea Break |
10:00-10:20 |
At the 1st floor |
Session A1
Network Algorithms
Guohui Lin
|
10:20-10:45 |
Linear-Time Algorithm for Computing the Most Reliable Source on a Tree
Wei Ding, Guoliang Xue |
10:45-11:10 |
A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines
Tim Nonner, Alexander Souza |
11:10-11:35 |
A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs
X. Li, X. Xu, F. Zou, H. Du, P. Wan, Y. Wang, Weili Wu |
11:35-12:00 |
Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks
Deying Li, Qinghua Zhu, Huiqiang Yang |
Session B1
Computational Geometry
Rudolf Fleischer |
10:20-10:45 |
On Open Rectangle-of-Influence Drawings of Planar Graphs
Huaming Zhang, Milind Vaidya |
10:45-11:10 |
Variable-Size Rectangle Covering
Francis Y.L. Chin, Hing-Fung Ting, Yong Zhang |
11:10-11:35 |
On-Line Multiple-Strip Packing
Deshi Ye, Xin Han, Guochuan Zhang |
11:35-12:00 |
A Kind of n-Vehicles Exploration Problem
Xiaoya Li, Jinchuan Cui |
Lunch |
12:00-13:00 |
Lunch at the 2nd floor (lunch-tickets are needed) |
Afternoon Sessions of June 10
Sessions/Chairs/Time |
Titles of Talks / Speakers and Authors |
Session A2
Bioinformatics
Guohui Lin |
14:00-14:25 |
DNA Library Screening, Pooling Design and Unitary
Suogang Gao, Zengti Li, Jiangchen Yu, Xiaofeng Gao, Weili Wu |
14:25-14:50 |
Improved Algorithms for the Gene Team Problem
Biing-Feng Wang, Shang-Ju Liu, Chien-Hsin Lin |
14:50-15:15 |
Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting
Yi Shi, Zhipeng Cai, Guohui Lin, Dale Schuurmans |
15:15-15:40 |
Matching Techniques Ride to Rescue OLED Displays
Andreas Karrenbauer |
Session B2
Graph Theory
Zhao Zhang |
14:00-14:25 |
On 3-edge-connected Supereulerian Graphs
Hong-Jian Lai, Hao Li, Yehong Shao, Mingquan Zhan |
14:25-14:50 |
A Note on n-Critical Bipartite Graphs and its Application
Yueping Li, Zhe Nie |
14:50-15:15 |
A Note on Edge Choosability and Degeneracy of Planar Graphs
Baoyindureng Wu, Xinhui An |
15:15-15:40 |
A Condition for the Forcing Number Equal to the Minimum Number of Trailing Vertices
Hongwei Wang |
Tea Break |
15:40-16:00 |
At the 1st floor |
Session A3
Combinatorics and Game
Theory
Yinfeng Xu |
16:00-16:25 |
Computing the Transitive Closure of a Union of Affine Integer Tuple Relations
Anna Beletska, Denis Barthou, Wlodzimierz Bielecki, Albert Cohen |
16:25-16:50 |
Generalized Russian Cards Problem
Chen Yang, Zhenhua Duan |
16:50-17:15 |
Improved Bounds for Facility Location Games with Fair Cost Allocation
Thomas Dueholm Hansen, Orestis A. Telelis |
17:15-17:40 |
A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing Game
Ruichun Yang, Zhen Wang, Dachuan Xu |
Session B3
Network and Graph Problems
Bethany Chan |
16:00-16:25 |
Size-Constrained Tree Partitioning for the Multicast k-Tree Routing Problem
Zhipeng Cai, Randy Goebel, Guohui Lin |
16:25-16:50 |
On Disjoint Shortest Paths Routing on the Hypercube
Eddie Cheng, Shuhong Gao, Ke Qiu, Zhizhang Shen |
16:50-17:15 |
On Integrity of Harary Graphs
Fengwei Li, Qingfang Ye, Baohuai Sheng |
17:15-17:40 |
Minimum Energy Broadcast Routing in Ad Hoc and Sensor Networks
Zheng Li, Deying Li |
Banquet |
18:30-20:00 |
Banquet at the 2nd floor (banquet-tickets are needed) |
Morning Sessions of June 11
Sessions/Chairs/Time |
Titles of Talks / Speakers and Authors |
Session A4
Graph Algorithms
Yuehua Bu |
08:20-08:45 |
Two-Level Heaps: a New Structure with Applications to the Shortest Path Problem
K. Subramani, Kamesh Madduri (Rudolf Fleischerwill present the paper) |
08:45-09:10 |
On Construction of Almost-Ramanujan Graphs
He Sun, Hong Zhu |
09:10-09:35 |
A 2log2(n)-Approximation Algorithm for Directed Tour Cover
Viet Hung Nguyen |
09:35-10:00 |
Approximation Algorithm for Max 3-Section Using Complex Semidefinite Programming
Ai-fan Ling |
Session B4
Online Problems
Rudolf Fleischer |
08:20-08:45 |
A Mathematical Programming Approach for Online Hierarchical Scheduling
Zhiyi Tan, An Zhang |
08:45-09:10 |
Optimal Algorithms for the Online Time Series Search Problem
Yinfeng Xu, Wenming Zhang, Feifeng Zheng |
09:10-09:35 |
A Note on Online Scheduling for Jobs with Arbitrary Release Times
Jihuan Ding, Guochuan Zhang |
09:35-10:00 |
A Risk-Reward Competitive Analysis for the Newsboy Problem with Range Information
Guiqing Zhang, Yinfeng Xu |
Tea Break |
10:00-10:20 |
At the 1st floor |
Session A5
Network (I)
Zhao Zhang |
10:20-10:45 |
A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem
Xiangyong Li, Y.P. Aneja |
10:45-11:10 |
Deterministically Estimating Data Stream Frequencies
Sumit Ganguly |
11:10-11:35 |
A New Design Approach for Rearrangeable Multicast Switching Networks
Hongbing Fan, Yu-Liang Wu |
11:35-12:00 |
Approximating the Multicast Traffic Grooming Problem in SONET/WDM Rings
Jiguo Yu, Suxia Cui, Guanghui Wang |
Session B5
Scheduling (I)
Xujin Chen |
10:20-10:45 |
Makespan Minimization with Machine Availability Constraints
Bin Fu, Yumei Huo, Hairong Zhao |
10:45-11:10 |
Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems
Nasser R. Sabar, Masri Ayob, Graham Kendall, Rong Qu |
11:10-11:35 |
Optimal Semi-Online Algorithm for Scheduling on a Batch Processing Machine
Ming Liu, Yinfeng Xu, Chengbin Chu, Lu Wang |
11:35-12:00 |
Integrated Production and Delivery Scheduling with Disjoint Windows
Yumei Huo, Joseph Y-T. Leung, Xin Wang |
Lunch |
12:00-13:00 |
Lunch (lunch-tickets are needed) |
Afternoon Sessions of June 11
Sessions/Chairs/Time |
Titles of Talks / Speakers and Authors |
Session A6
Network (II)
Xiaodong Hu |
14:00-14:25 |
An Algorithm with Better Approximation Ratio for Multicast Traffic in SONET Rings
Jiguo Yu, Suxia Cui, Guanghui Wang |
14:25-14:50 |
Infinite Family from Each Vertex k-Critical Graph without Any Critical Edge
Jixing Wang |
14:50-15:15 |
Effects of Delayed Cell-Lysis in a Mathematical Model of Host Pathogen
Biplab Chattopadhyay, Priti Kumar Roy, and Dipak Kesh |
15:15-15:40 |
Recoverable Robust Timetables on Trees
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Cristina M. Pinotti |
Session B6
Scheduling (II)
Yinfeng Xu |
14:00-14:25 |
Scheduling Problems in Cross Docking
Chen Rongjun, Baoqiang Fan, Guo-Chun Tang |
14:25-14:50 |
Bicriteria Scheduling Jobs on a Single-Machine with Inventory Operations
Baoqiang Fan, Rongjun Chen, Guo-Chun Tang |
14:50-15:15 |
Approximation Algorithms for Minimizing the Weighted Number of Tardy Jobs
Jianfeng Ren, Yuzhong Zhang, Xianzhao Zhang, Sun Guo |
15:15-15:40 |
Scheduling with Rejection to Minimize the Makespan
Yuzhong Zhang, Jianfeng Ren, Chengfei Wang |
Cultural program |
17:30-20:00 |
Gather at the lobby and then have dinner at “Native Place of Hui Merchant Restaurant” outside the hotel enjoying typical food and performance at Huangshan. |
One-Day Tour of June 12
(One-day-tour-tickets are needed)
Time |
Activities |
Morning |
07:30-08:30 |
Meet at the lobby and go to Huangshan via limousine
(Participants are encouraged to put on casual clothes and sneakers) |
08:30-09:00 |
Get to the top of Huangshan via cable |
09:00-12:30 |
Enjoy beautiful scenery of Huangshan |
Lunch |
12:30-13:30 |
Table dinner at West Sea restaurant on the top of Huangshan |
Afternoon |
13:30-16:00 |
Enjoy beautiful scenery of Huangshan |
16:00-16:30 |
Get to the foot of Huangshan via cable |
16:30-17:30 |
Return to the city |
Evening |
17:30-19:00 |
Dinner at “Riverside Restaurant” beside the Xin An River. |
|
|
|