Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Combinatorial Optimization and Applications: Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings > Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation
Combinatorial Optimization and Applications: Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings |
Ding-Zhu Du; Xiaodong Hu; Panos M. Pardalos
Springer Berlin Heidelberg
Combinatorial Optimization and Applications: Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings
Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation
Authors

Ai-fan Ling

ARI Id

1664728066485_2963392

Access

Not Available Free

Pages

219-230

DOI

10.1007/978-3-642-02026-1_20

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-642-02026-1_20

Table of Contents of Book
Showing 1 to 20 of 52 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision
Jianping Li; Weidong Li; Jianbo Li
1-13
A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices
Wei Ding; Guoliang Xue
14-23
A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines
Tim Nonner; Alexander Souza
24-35
A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs
Xianyue Li; Xiao-Hua Xu; Feng Zou; Hongwei Du; Pengjun Wan; Yuexuan Wang et al.
36-48
DNA Library Screening, Pooling Design and Unitary Spaces
Suogang Gao; Zengti Li; Jiangchen Yu; Xiaofeng Gao; Weili Wu
49-60
Improved Algorithms for the Gene Team Problem
Biing-Feng Wang; Shang-Ju Liu; Chien-Hsin Lin
61-72
Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting
Yi Shi; Zhipeng Cai; Guohui Lin; Dale Schuurmans
73-84
Generalized Russian Cards Problem
Zhenhua Duan; Chen Yang
85-97
Computing the Transitive Closure of a Union of Affine Integer Tuple Relations
Anna Beletska; Denis Barthou; Wlodzimierz Bielecki; Albert Cohen
98-109
Matching Techniques Ride to Rescue OLED Displays
Andreas Karrenbauer
110-122
On Open Rectangle-of-Influence Drawings of Planar Graphs
Huaming Zhang; Milind Vaidya
123-134
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
Jingfa Liu; Yonglei Yao; Yu Zheng; Huantong Geng; Guocheng Zhou
135-144
Variable-Size Rectangle Covering
Francis Y. L. Chin; Hing-Fung Ting; Yong Zhang
145-154
On-Line Multiple-Strip Packing
Deshi Ye; Xin Han; Guochuan Zhang
155-165
A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing Game
Ruichun Yang; Zhen Wang; Dachuan Xu
166-173
Improved Bounds for Facility Location Games with Fair Cost Allocation
Thomas Dueholm Hansen; Orestis A. Telelis
174-185
Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem
K. Subramani; Kamesh Madduri
186-196
On Construction of Almost-Ramanujan Graphs
He Sun; Hong Zhu
197-207
A 2log2(n)-Approximation Algorithm for Directed Tour Cover
Viet Hung Nguyen
208-218
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 52 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings