Table of Contents

• Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service ProvisionJianping Li, Weidong Li, Jianbo Li. 1-13 [doi]
• A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty VerticesWei Ding, Guoliang Xue. 14-23 [doi]
• A 5/3-Approximation Algorithm for Joint Replenishment with DeadlinesTim Nonner, Alexander Souza. 24-35 [doi]
• A PTAS for Node-Weighted Steiner Tree in Unit Disk GraphsXianyue Li, Xiao-hua Xu, Feng Zou, Hongwei Du, Peng-Jun Wan, Yuexuan Wang, Weili Wu. 36-48 [doi]
• DNA Library Screening, Pooling Design and Unitary SpacesSuogang Gao, Zengti Li, Jiangchen Yu, Xiaofeng Gao, Weili Wu. 49-60 [doi]
• Improved Algorithms for the Gene Team ProblemBiing-Feng Wang, Shang-Ju Liu, Chien-Hsin Lin. 61-72 [doi]
• Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority VotingYi Shi, Zhipeng Cai, Guohui Lin, Dale Schuurmans. 73-84 [doi]
• Generalized Russian Cards ProblemZhenhua Duan, Chen Yang. 85-97 [doi]
• Computing the Transitive Closure of a Union of Affine Integer Tuple RelationsAnna Beletska, Denis Barthou, Wlodzimierz Bielecki, Albert Cohen. 98-109 [doi]
• Matching Techniques Ride to Rescue OLED DisplaysAndreas Karrenbauer. 110-122 [doi]
• On Open Rectangle-of-Influence Drawings of Planar GraphsHuaming Zhang, Milind Vaidya. 123-134 [doi]
• An Effective Hybrid Algorithm for the Circles and Spheres Packing ProblemsJingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng, Guocheng Zhou. 135-144 [doi]
• Variable-Size Rectangle CoveringFrancis Y. L. Chin, Hing-Fung Ting, Yong Zhang. 145-154 [doi]
• On-Line Multiple-Strip PackingDeshi Ye, Xin Han, Guochuan Zhang. 155-165 [doi]
• A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing GameRuichun Yang, Zhen Wang, Dachuan Xu. 166-173 [doi]
• Improved Bounds for Facility Location Games with Fair Cost AllocationThomas Dueholm Hansen, Orestis Telelis. 174-185 [doi]
• Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path ProblemK. Subramani, Kamesh Madduri. 186-196 [doi]
• On Construction of Almost-Ramanujan GraphsHe Sun, Hong Zhu. 197-207 [doi]
• A 2log2(n)-Approximation Algorithm for Directed Tour CoverViet Hung Nguyen. 208-218 [doi]
• Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming RelaxationAi-fan Ling. 219-230 [doi]
• Hamiltonian Decomposition of Some Interconnection NetworksHai-Zhong Shi, Pan-feng Niu. 231-237 [doi]
• Infinite Family from Each Vertex k-Critical Graph without Any Critical EdgeJixing Wang. 238-248 [doi]
• A Note on Edge Choosability and Degeneracy of Planar GraphsBaoyindureng Wu, Xinhui An. 249-257 [doi]
• A Sufficient and Necessary Condition for the Forcing Number of a Bipartite Graph Being Equal to the Minimum Number of Trailing VerticesHongwei Wang. 258-268 [doi]
• On Integrity of Harary GraphsFengwei Li, Qingfang Ye, Baohuai Sheng. 269-278 [doi]
• A Note on n-Critical Bipartite Graphs and Its ApplicationYueping Li, Zhe Nie. 279-286 [doi]
• Real-Time Algorithm Scheme for n-Vehicle Exploration ProblemXiaoya Li, Jinchuan Cui. 287-300 [doi]
• Deterministically Estimating Data Stream FrequenciesSumit Ganguly. 301-312 [doi]
• Positive Influence Dominating Set in Online Social NetworksFeng Wang 0002, Erika Camacho, Kuai Xu. 313-321 [doi]
• Optimal Algorithms for the Online Time Series Search ProblemYinfeng Xu, Wenming Zhang, Feifeng Zheng. 322-333 [doi]
• A Risk-Reward Competitive Analysis for the Newsboy Problem with Range InformationGuiqing Zhang, Yinfeng Xu. 334-345 [doi]
• Optimal Semi-online Algorithm for Scheduling on a Batch Processing MachineMing Liu, Yinfeng Xu, Chengbin Chu, Lu Wang. 346-353 [doi]
• A Note on Online Scheduling for Jobs with Arbitrary Release TimesJihuan Ding, Guochuan Zhang. 354-362 [doi]
• Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing ProblemZhipeng Cai, Randy Goebel, Guohui Lin. 363-374 [doi]
• On Disjoint Shortest Paths Routing on the HypercubeEddie Cheng, Shuhong Gao, Ke Qiu, Zhizhang Shen. 375-383 [doi]
• A New Approach for Rearrangeable Multicast Switching NetworksHongbing Fan, Yu-Liang Wu. 384-394 [doi]
• Bicriteria Scheduling on Single-Machine with Inventory OperationsBaoqiang Fan, Rongjun Chen, Guochun Tang. 395-402 [doi]
• Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch MachineJianfeng Ren, Yuzhong Zhang, Xianzhao Zhang, Guo Sun. 403-410 [doi]
• Scheduling with Rejection to Minimize the MakespanYuzhong Zhang, Jianfeng Ren, Chengfei Wang. 411-420 [doi]
• Scheduling Problems in Cross DockingRongjun Chen, Baoqiang Fan, Guochun Tang. 421-429 [doi]
• Makespan Minimization with Machine Availability ConstraintsBin Fu, Yumei Huo, Hairong Zhao. 430-437 [doi]
• A Mathematical Programming Approach for Online Hierarchical SchedulingZhiyi Tan, An Zhang. 438-450 [doi]
• Recoverable Robust Timetables on TreesGianlorenzo D Angelo, Gabriele Di Stefano, Alfredo Navarra, Maria Cristina Pinotti. 451-462 [doi]
• Roulette Wheel Graph Colouring for Solving Examination Timetabling ProblemsNasser R. Sabar, Masri Ayob, Graham Kendall, Rong Qu. 463-470 [doi]
• Integrated Production and Delivery Scheduling with Disjoint WindowsYumei Huo, Joseph Y.-T. Leung, Xin Wang. 471-482 [doi]
• Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless NetworksDeying Li, Qinghua Zhu, Huiqiang Yang. 483-493 [doi]
• A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless NetworksXiangyong Li, Yash P. Aneja. 494-506 [doi]
• Minimum Energy Broadcast Routing in Ad Hoc and Sensor Networks with Directional AntennasZheng Li, Deying Li. 507-518 [doi]
• Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM RingsJiguo Yu, Suxia Cui, Guanghui Wang. 519-529 [doi]
• An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM RingsJiguo Yu, Suxia Cui, Guanghui Wang. 530-540 [doi]