最大简单共享问题的快速近似算法 - semantic scholar.pdfVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software, Vol.19, No.3, March 2008, pp .492−499 http://www.j DOI: 10.3724/SP.J.1001.2008.00492 Tel/Fax : +86-10 © 2007 by Journal of Software. All rights reserved. ∗ 最大简单共享问题的快速近似算法 + 李 建 , 张 韬, 谢之易, 朱 洪 (复旦大学 计算机科学与工程系,上海 200433) An Efficient Approximation Algorithm for Maximum Simple Sharing Problem + LI Jian , ZHANG Tao, XIE Zhi-Yi, ZHU Hong (Department of Computer Science and Engineering, Fudan University, Shanghai 200433, China) + Corresponding author: Phn: +86-21 E-mail: lijian83@, /~lijian Li J, Zhang T, Xie ZY, Zhu H. An efficient approximation algorithm for maximum simple sharing problem. Journal of Software, 2008,19(3):492−499. /1000-9825/19/492.htm Abstract: For many circuit design problems, it is imperative to carefully study the effect of physical implementation constraints. Under some circumstances, it is very difficult to fabricate wire crossings. In this paper, we introduce a crossing elimination model based on a node duplication method and we want to minimize the number of duplication. We relate it with an artificial problem, called the maximum simple sharing problem. First we prove it is NP-hard, then we show that a simple greedy algorithm can achieve an approximation factor of 3. We then introduce the maximum disjoint simple sharing problem, which is naturally a 2-approximation of the maximum simple sharing problem, and show that it can be solved optimally by reducing to the perfect matching problem in a series of carefully constructed graph. At last, we further improve the approximation fact