Constant-Factor Approximation Algorithms for Convex Cover and Hidden Set in a Simple Polygon

被引：0
|
作者：
Browne, Reilly [1 ]
Kasthurirangan, Prahlad Narasimham [1 ]
Mitchell, Joseph S. B. [1 ]
Polishchuk, Valentin [2 ]
机构：
[1] SUNY Stony Brook, Stony Brook, NY 11794 USA
[2] Linkoping Univ, Linkoping, Sweden
来源：
2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS | 2023年
基金：
美国国家科学基金会; 瑞典研究理事会;
关键词：
MINIMUM-LINK PATHS; VISIBILITY; INAPPROXIMABILITY;
D O I：
10.1109/FOCS57990.2023.00083
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Given a simple polygon P, the minimum convex cover problem seeks to cover P with the fewest convex polygons that lie within P. The maximum hidden set problem seeks to place within P a maximum cardinality set of points no two of which see each other. We give constant factor approximation algorithms for both problems. Previously, the best approximation factor for the minimum convex cover was logarithmic; for the maximum hidden set problem, no approximation algorithm was known.
引用
收藏
页码：1357 / 1365
页数：9
相关论文
共 50 条
  • [1] A constant-factor approximation for weighted bond cover ☆
    Kim, Eun Jung
    Lee, Euiwoong
    Thilikos, Dimitrios M.
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2025, 149
  • [2] A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with Unit Disks
    Madireddy, Raghunath Reddy
    Mudgal, Apurva
    ALGORITHMICA, 2023, 85 (01) : 100 - 132
  • [3] A CONSTANT-FACTOR APPROXIMATION ALGORITHM FOR VERTEX GUARDING A WV-POLYGON
    Ashur, Stay
    Filtser, Omrit
    Katz, Matthew J.
    JOURNAL OF COMPUTATIONAL GEOMETRY, 2021, 12 (01) : 128 - 144
  • [4] Constant-Factor Approximation Algorithms for Identifying Dynamic Communities
    Tantipathananandh, Chayant
    Berger-Wolf, Tanya
    KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2009, : 827 - 835
  • [5] Constant-factor approximation algorithms for domination problems on circle graphs
    Damian-Iordache, M
    Pemmaraju, SV
    ALGORITHMS AND COMPUTATIONS, 2000, 1741 : 70 - 82
  • [6] A better constant-factor approximation for weighted dominating set in unit disk graph
    Huang, Yaochun
    Gao, Xiaofeng
    Zhang, Zhao
    Wu, Weili
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2009, 18 (02) : 179 - 194
  • [7] Constant-Factor Approximations for Cycle Cover Problems
    Ageev, Alexander
    DISCRETE OPTIMIZATION AND OPERATIONS RESEARCH, DOOR 2016, 2016, 9869 : 93 - 104
  • [8] A better constant-factor approximation for weighted dominating set in unit disk graph
    Yaochun Huang
    Xiaofeng Gao
    Zhao Zhang
    Weili Wu
    Journal of Combinatorial Optimization, 2009, 18 : 179 - 194
  • [9] A Constant-Factor Approximation for Stochastic Steiner Forest
    Gupta, Anupam
    Kumar, Amit
    STOC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2009, : 659 - 668
  • [10] Approximation algorithms for inscribing or circumscribing an axially symmetric polygon to a convex polygon
    Ahn, HK
    Brass, P
    Cheong, O
    Na, HS
    Shin, CS
    Vigneron, A
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2004, 3106 : 259 - 267
12345