Table Of ContentLecture Notes in Computer Science 5573
CommencedPublicationin1973
FoundingandFormerSeriesEditors:
GerhardGoos,JurisHartmanis,andJanvanLeeuwen
EditorialBoard
DavidHutchison
LancasterUniversity,UK
TakeoKanade
CarnegieMellonUniversity,Pittsburgh,PA,USA
JosefKittler
UniversityofSurrey,Guildford,UK
JonM.Kleinberg
CornellUniversity,Ithaca,NY,USA
AlfredKobsa
UniversityofCalifornia,Irvine,CA,USA
FriedemannMattern
ETHZurich,Switzerland
JohnC.Mitchell
StanfordUniversity,CA,USA
MoniNaor
WeizmannInstituteofScience,Rehovot,Israel
OscarNierstrasz
UniversityofBern,Switzerland
C.PanduRangan
IndianInstituteofTechnology,Madras,India
BernhardSteffen
UniversityofDortmund,Germany
MadhuSudan
MassachusettsInstituteofTechnology,MA,USA
DemetriTerzopoulos
UniversityofCalifornia,LosAngeles,CA,USA
DougTygar
UniversityofCalifornia,Berkeley,CA,USA
GerhardWeikum
Max-PlanckInstituteofComputerScience,Saarbruecken,Germany
Ding-Zhu Du Xiaodong Hu
Panos M. Pardalos (Eds.)
Combinatorial
Optimization
and Applications
Third International Conference, COCOA 2009
Huangshan, China, June 10-12, 2009
Proceedings
1 3
VolumeEditors
Ding-ZhuDu
UniversityofTexasatDallas,DepartmentofComputerScience
800WestCampbellRoad,Richardson,TX75080-3021,USA
E-mail:[email protected]
XiaodongHu
ChineseAcademyofSciences,InstituteofAppliedMathematics
ZhongGuanCunDongLu55,Beijing100190,P.R.China
E-mail:[email protected]
PanosM.Pardalos
UniversityofFlorida,DepartmentofIndustrialandSystemsEngineering
303WeilHall,P.O.Box116595,Gainesville,FL32611-6595,USA
E-mail:pardalos@ufl.edu
LibraryofCongressControlNumber:Appliedfor
CRSubjectClassification(1998):F.2,G.1.6,G.2,H.1,I.3.5
LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues
ISSN 0302-9743
ISBN-10 3-642-02025-9SpringerBerlinHeidelbergNewYork
ISBN-13 978-3-642-02025-4SpringerBerlinHeidelbergNewYork
Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis
concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting,
reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication
orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965,
initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Violationsareliable
toprosecutionundertheGermanCopyrightLaw.
springer.com
©Springer-VerlagBerlinHeidelberg2009
PrintedinGermany
Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India
Printedonacid-freepaper SPIN:12684359 06/3180 543210
Preface
TheThirdAnnualInternationalConferenceonCombinatorialOptimizationand
Applications,COCOA2009,tookplaceinHuangshan,China,June10–12,2009.
Past COCOA conferences were held in Xi’an, China (2007) and Newfoundland,
Canada (2008).
COCOA2009providedaforumforresearchersworkingintheareasofcombi-
natorialoptimization andits applications.Inaddition to theoreticalresults,the
conference is particularly focused on recent works on experimental and applied
research of general algorithmic interest. The Program Committee received 103
submissions from 17 countries and regions: Brazil, Canada, China, Denmark,
France, Germany, Hong Kong, India, Italy, Japan, Korea, Malaysia, Poland,
Switzerland, Taiwan, UK, and USA.
Among the 103 submissions, 50 papers were selected for presentation at the
conference and are included in this volume. Some of these will be selected for
publicationinaspecialissueofJournalofCombinatorial Optimization,aspecial
issue of Theoretical Computer Science, and a special issue of Discrete Mathe-
matics, Algorithms and Applications under the standard refereeing procedure.
In addition to the selected papers, the conference also included one invited pre-
sentation by Panos M. Pardalos (University of Florida, USA).
We thank the authors for submitting their papers to the conference. We are
grateful to the members of the Program Committee and the external referees
for their work within demanding time constraints. We thank the Organizing
Committee for their contribution to make the conference a success. We also
thank Donghyun Kim for helping us create and update the conference website
and maintain the Springer Online Conference Service system.
Finally, we thank the conference sponsors and supporting organizations for
their support and assistance. COCOA 2009 was supported in part by the Na-
tionalNaturalScienceFoundationofChinaunderGrantNo.10531070,10771209,
10721101 and the Chinese Academy of Sciences under Grant No. kjcx-yw-s7.
COCOA 2009 was held at Huangshan International Hotel, Huangshan, China.
June 2009 Ding-Zhu Du
Xiaodong Hu
Panos M. Pardalos
Organization
Executive Committee
Conference Chair: Ding-Zhu Du University of Texas at Dallas, USA
Program Committee
Vladimir L. Boginski University of Florida, USA
Sergiy Butenko Texas A&M University, USA
Zhipeng Cai University of Alberta, Canada
Gerard Jennhwa Chang National Taiwan University, Taiwan
Maggie Cheng Missouri University of Science and
Technology, USA
Wanpracha Art
Chaovalitwongse The State University of New Jersey, USA
Bo Chen University of Warwick, UK
Ding-Zhu Du University of Texas at Dallas, USA; Co-chair
Rudolf Fleischer Fudan University, China
Christodoulos A. FloudasPrinceton University, USA
Xiaodong Hu ChineseAcademyofSciences,China;Co-chair
Hejiao Huang Harbin Institute of Technology, China
Marek Karpinski University of Bonn, Germany
Naoki Katoh Kyoto University, Japan
Ilias S. Kotsireas Wilfrid Laurier University, Canada
Der-Tsai Lee Acdemia Sinica, Taiwan
Guohui Lin University of Alberta, Canada
Carlos Oliveira Princeton Consultants, Inc., USA
Panos M. Pardalos University of Florida, USA; Co-chair
Leonidas Pitsoulis Aristotle University of Thessaloniki, Greece
Oleg Prokopyev University of Pittsburgh, USA
Yuehua Pu Zhejiang Normal University, China
Liqun Qi Hong Kong Polytechnic University,
Hong Kong
Michel Raynal Universit´e de Rennes, France
Franz Rendl Universita¨t Klagenfurt, Austria
Lu Ruan Iowa State University, USA
Onur Seref Virginia Tech, USA
Alexander Schliep Max Planck Institute for Molecular Genetics,
Germany
Guochun Tang Shanghai University, China
My T. Thai University of Florida, USA
VIII Organization
Doreen Anne Thomas University of Melbourne, Austrilia
Feng Wang Arizona State University, USA
Jie Wang University of Massachusetts Lowell, USA
Lusheng Wang City University of Hong Kong, Hong Kong
Weili Wu University of Texas at Dallas, USA
Yinfeng Xu Xi’an Jiaotong University, China
Boting Yang University of Regina, Canada
Jianzhong Zhang ChineseUniversityofHongKong,HongKong
Zhao Zhang Xinjiang University, China
Constantin Zopounidis Technical University of Crete, Greece
Organizing Committee
Xujin Chen Chinese Academy of Sciences, China
Jie Hu Operations Research Society of China, China
Xudong Hu Chinese Academy of Sciences, China; Chair
Aimin Jiang Chinese Academy of Sciences, China
Degang Liu Operations Research Society of China, China
Sponsoring Institutions
Academy of Math and System Science, Chinese Academy of Sciences, China
Operations Research Society of China, China
University of Texas at Dallas, USA
Table of Contents
Algorithms for Network Design
Polynomial Approximation Schemes for the Max-Min Allocation
Problem under a Grade of Service Provision......................... 1
Jianping Li, Weidong Li, and Jianbo Li
A Linear Time Algorithm for Computing the Most Reliable Source on
a Tree with Faulty Vertices........................................ 14
Wei Ding and Guoliang Xue
A 5/3-Approximation Algorithm for Joint Replenishment with
Deadlines ....................................................... 24
Tim Nonner and Alexander Souza
A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs ......... 36
Xianyue Li, Xiao-Hua Xu, Feng Zou, Hongwei Du, Pengjun Wan,
Yuexuan Wang, and Weili Wu
Bioinformatics
DNA Library Screening, Pooling Design and Unitary Spaces........... 49
Suogang Gao, Zengti Li, Jiangchen Yu, Xiaofeng Gao, and Weili Wu
Improved Algorithms for the Gene Team Problem.................... 61
Biing-Feng Wang, Shang-Ju Liu, and Chien-Hsin Lin
Linear Coherent Bi-cluster Discovery via Line Detection and Sample
Majority Voting ................................................. 73
Yi Shi, Zhipeng Cai, Guohui Lin, and Dale Schuurmans
Combinatorics and Its Applications
Generalized Russian Cards Problem ................................ 85
Zhenhua Duan and Chen Yang
Computing the Transitive Closure of a Union of Affine Integer Tuple
Relations ....................................................... 98
Anna Beletska, Denis Barthou, Wlodzimierz Bielecki, and
Albert Cohen
Matching Techniques Ride to Rescue OLED Displays................. 110
Andreas Karrenbauer
X Table of Contents
Computational Geometry
On Open Rectangle-of-Influence Drawings of Planar Graphs........... 123
Huaming Zhang and Milind Vaidya
An Effective Hybrid Algorithm for the Circles and Spheres Packing
Problems ....................................................... 135
Jingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng, and
Guocheng Zhou
Variable-Size Rectangle Covering................................... 145
Francis Y.L. Chin, Hing-Fung Ting, and Yong Zhang
On-Line Multiple-Strip Packing.................................... 155
Deshi Ye, Xin Han, and Guochuan Zhang
Game Theory
A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing
Game .......................................................... 166
Ruichun Yang, Zhen Wang, and Dachuan Xu
Improved Bounds for Facility Location Games with Fair Cost
Allocation ...................................................... 174
Thomas Dueholm Hansen and Orestis A. Telelis
Graph Algorithms
Two-Level Heaps: A New Priority Queue Structure with Applications
to the Single Source Shortest Path Problem ......................... 186
K. Subramani and Kamesh Madduri
On Construction of Almost-Ramanujan Graphs...................... 197
He Sun and Hong Zhu
A 2log (n)-Approximation Algorithm for Directed Tour Cover......... 208
2
Viet Hung Nguyen
Approximation Algorithms for Max 3-Section Using Complex
Semidefinite Programming Relaxation .............................. 219
Ai-fan Ling
Graph Theory
Hamiltonian Decomposition of Some Interconnection Networks ........ 231
Hai-zhong Shi and Pan-feng Niu
Table of Contents XI
Infinite FamilyfromEachVertexk-CriticalGraphwithoutAnyCritical
Edge ........................................................... 238
Jixing Wang
A Note on Edge Choosability and Degeneracy of Planar Graphs ....... 249
Baoyindureng Wu and Xinhui An
A Sufficient and Necessary Condition for the Forcing Number of a
Bipartite Graph Being Equal to the Minimum Number of Trailing
Vertices ........................................................ 258
Hongwei Wang
On Integrity of Harary Graphs..................................... 269
Fengwei Li, Qingfang Ye, and Baohuai Sheng
A Note on n-Critical Bipartite Graphs and Its Application ............ 279
Yueping Li and Zhe Nie
Network Models and Problems
Real-Time Algorithm Scheme for n-Vehicle Exploration Problem....... 287
Xiaoya Li and Jinchuan Cui
Deterministically Estimating Data Stream Frequencies................ 301
Sumit Ganguly
Positive Influence Dominating Set in Online Social Networks .......... 313
Feng Wang, Erika Camacho, and Kuai Xu
On-line Algorithms
Optimal Algorithms for the Online Time Series Search Problem........ 322
Yinfeng Xu, Wenming Zhang, and Feifeng Zheng
A Risk-Reward Competitive Analysis for the Newsboy Problem with
Range Information ............................................... 334
Guiqing Zhang and Yinfeng Xu
Optimal Semi-online Algorithm for Scheduling on a Batch Processing
Machine ........................................................ 346
Ming Liu, Yinfeng Xu, Chengbin Chu, and Lu Wang
A Note on Online Scheduling for Jobs with Arbitrary Release Times ... 354
Jihuan Ding and Guochuan Zhang
Size-Problems
Size-Constrained Tree Partitioning: A Story on Approximation
Algorithm Design for the Multicast k-Tree Routing Problem........... 363
Zhipeng Cai, Randy Goebel, and Guohui Lin
