Solving the set cover problem in the tile assembly model

被引：0
|
作者：
机构：
[1] [1,2,Xu, Zhou
[2] 1,Tao, Zhou Yan
[3] Li, Li Ken
来源：
Tao, Z. Y. (Yantao_z@hnu.edu.cn) | 2013年 / Springer Verlag卷 / 212期
基金：
中国国家自然科学基金;
关键词：
Computers;
D O I：
10.1007/978-3-642-37502-6_35
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] Molecular solutions for minimum and exact cover problems in the tile assembly model
    Zhou, Xu
    Zhou, YanTao
    Li, KenLi
    Sallam, Ahmed
    Li, Keqin
    JOURNAL OF SUPERCOMPUTING, 2014, 69 (02): : 976 - 1005
  • [22] Solving satisfiability in the tile assembly model with a constant-size tileset
    Brun, Yuriy
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2008, 63 (04): : 151 - 166
  • [23] Algorithm for Solving the Generalized Set Cover Problem for a Special Class of Problems
    Zykina A.V.
    Munko V.V.
    Journal of Mathematical Sciences, 2022, 267 (4) : 519 - 528
  • [24] Solving River Crossing Puzzle in the DNA Tile Self-Assembly Model
    Wang, Yanfeng
    Zheng, Yan
    Zhang, Xuncai
    Cui, Guangzhao
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2011, 8 (04) : 579 - 585
  • [25] Solving Minimum Hitting Set Problem and Generalized Exact Cover Problem with Light Based Devices
    Hasan, Masud
    Hossain, Shabab
    Rahman, Md. Mahmudur
    Rahman, M. Sohel
    INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING, 2011, 7 (1-2) : 125 - 140
  • [26] Greedy Game Algorithms for Solving SET K-Cover Problem in HWSNs
    Yan, Wenjie
    Cao, Mengjing
    Wu, Youxi
    Zhang, Jun
    IEEE ACCESS, 2018, 6 : 65604 - 65619
  • [27] Algorithm of Solving the Subset-Product Problem Based on DNA Tile Self-Assembly
    Cheng, Zhen
    Xu, Jin
    Huang, Yufang
    Zhang, Xuncai
    Zhou, Kang
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2009, 6 (05) : 1161 - 1169
  • [28] Scheduling algorithm for AND/OR precedence constrained tasks based on solving the set-cover problem
    College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, China
    Harbin Gongcheng Daxue Xuebao, 2007, 5 (559-565):
  • [29] THE ONLINE SET COVER PROBLEM
    Alon, Noga
    Awerbuch, Baruch
    Azar, Yossi
    Buchbinder, Niv
    Naor, Joseph
    SIAM JOURNAL ON COMPUTING, 2009, 39 (02) : 361 - 370
  • [30] The pipelined set cover problem
    Munagala, K
    Babu, S
    Motwani, R
    Widom, J
    DATABASE THEORY - ICDT 2005, PROCEEDINGS, 2005, 3363 : 83 - 98
12345