Sciweavers

Share
COCOA
2009
Springer

An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems

12 years 3 months ago
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes for the Max-Min Allocation Problem Jianping Li, Weidong Li, Jianbo Li 10:45-11:10 Linear-Time Algorithm for Computing the Most Reliable Source on a Tree Wei Ding, Guoliang Xue 11:10-11:35 A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines Tim Nonner, Alexander Souza Session A1 Algorithms for Network Design 11:35-12:00 A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs Xianyue Li, Xiaohua Xu, Feng Zou,Hongwei Du, Pengjun Wan, Yuexuan Wang, Weili Wu 10:20-10:45 On Open Rectangle-of-Influence Drawings of Planar Graphs Huaming Zhang, Milind Vaidya 10:45-11:10 An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems Liu Jingfa, Yonglei Yao, Yu Zheng, Huantong Geng, Guocheng Zhou 11:10-11:35 Variable-Size Rectangle Covering Francis Y.L. Chin, Hing-Fung Ting, Yong Zhang Ses...
Jingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng,
Added 02 Sep 2010
Updated 02 Sep 2010
Type Conference
Year 2009
Where COCOA
Authors Jingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng, Guocheng Zhou
Comments (0)
books