Approximation and exact algorithms for minimum-width annuli and shells

被引：0
|
作者：
Agarwal, Pankaj K. [1 ]
Aronov, Boris [1 ]
Har-Peled, Sariel [1 ]
Sharir, Micha [1 ]
机构：
[1] Duke Univ, Durham, NC, United States
来源：
Proceedings of the Annual Symposium on Computational Geometry | 1999年
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
下载
收藏
页码：380 / 389
相关论文
共 50 条
  • [41] High speed layout synthesis for minimum-width CMOS logic cells via boolean satisfiability
    Iizuka, T
    Ikeda, M
    Asada, K
    ASP-DAC 2004: PROCEEDINGS OF THE ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, 2004, : 149 - 154
  • [42] An Evaluation on the Accuracy of the Minimum-Width Transistor Area Models in Ranking the Layout Area of FPGA Architectures
    Khan, Farheen Fatima
    Ye, Andy
    ACM TRANSACTIONS ON RECONFIGURABLE TECHNOLOGY AND SYSTEMS, 2018, 11 (01)
  • [43] On approximation algorithms for the minimum satisfiability problem
    Marathe, MV
    Ravi, SS
    INFORMATION PROCESSING LETTERS, 1996, 58 (01) : 23 - 29
  • [44] Approximation Algorithms for Minimum K -Cut
    N. Guttmann-Beck
    R. Hassin
    Algorithmica, 2000, 27 : 198 - 207
  • [45] Approximation algorithms for minimum tree partition
    Guttmann-Beck, N
    Hassin, R
    DISCRETE APPLIED MATHEMATICS, 1998, 87 (1-3) : 117 - 137
  • [46] Exact algorithms for minimum routing cost trees
    Fischetti, M
    Lancia, G
    Serafini, P
    NETWORKS, 2002, 39 (03) : 161 - 173
  • [47] Exact algorithms for treewidth and minimum fill-in
    Fomin, Fedor V.
    Kratsch, Dieter
    Todinca, Ioan
    Villanger, Yngve
    SIAM JOURNAL ON COMPUTING, 2008, 38 (03) : 1058 - 1079
  • [48] Exact algorithms for a loading problem with bounded clique width
    Moonen, Linda S.
    Spieksma, Frits C. R.
    INFORMS JOURNAL ON COMPUTING, 2006, 18 (04) : 455 - 465
  • [49] Spatial skyline queries: exact and approximation algorithms
    Mu-Woong Lee
    Wanbin Son
    Hee-Kap Ahn
    Seung-won Hwang
    GeoInformatica, 2011, 15 : 665 - 697
  • [50] On exact and approximation algorithms for distinguishing substring selection
    Gramm, J
    Guo, J
    Niedermeier, R
    FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 2003, 2751 : 195 - 209
12345