Deterministic Replacement Path Covering

被引：0
|
作者：
Karthik, C. S. [1 ]
Parter, Merav [2 ]
机构：
[1] Tel Aviv Univ, Tel Aviv, Israel
[2] Weizmann Inst Sci, Rehovot, Israel
来源：
ACM TRANSACTIONS ON ALGORITHMS | 2024年 / 20卷 / 04期
基金：
以色列科学基金会;
关键词：
CONSTRUCTION; FAMILIES; CODES; COMPLEXITY; CURVES;
D O I：
10.1145/3673760
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
43
引用
收藏
页数：35
相关论文
共 50 条
  • [21] Exploiting deterministic TPG for path delay testing
    Li, XW
    Cheung, PYS
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2000, 15 (05) : 472 - 479
  • [22] Deterministic and stochastic global optimization techniques for planar covering with ellipses problems
    Andretta, M.
    Birgin, E. G.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 224 (01) : 23 - 40
  • [23] Linearly bounded liars, adaptive covering codes, and deterministic random walks
    Cooper, Joshua N.
    Ellis, Robert B.
    JOURNAL OF COMBINATORICS, 2010, 1 (03) : 307 - 333
  • [24] The Online Replacement Path Problem
    Adjiashvili, David
    Oriolo, Gianpaolo
    Senatore, Marco
    ALGORITHMS - ESA 2013, 2013, 8125 : 1 - 12
  • [25] Cardinality constrained Path Covering Problems in grid graphs
    Apollonio, N
    Caccetta, L
    Simeone, B
    NETWORKS, 2004, 44 (02) : 120 - 131
  • [26] THE MINIMUM-COVERING SHORTEST-PATH PROBLEM
    CURRENT, J
    REVELLE, C
    COHON, J
    DECISION SCIENCES, 1988, 19 (03) : 490 - 503
  • [27] PATH COVERING PROBLEMS AND TESTING OF PRINTED-CIRCUITS
    ANDREATTA, G
    MASON, F
    DISCRETE APPLIED MATHEMATICS, 1995, 62 (1-3) : 5 - 13
  • [28] EFFICIENT ALGORITHMS FOR SOLVING THE SHORTEST COVERING PATH PROBLEM
    CURRENT, J
    PIRKUL, H
    ROLLAND, E
    TRANSPORTATION SCIENCE, 1994, 28 (04) : 317 - 327
  • [29] Group path covering and distance two labeling of graphs
    Wang, Feng
    Lin, Wensong
    INFORMATION PROCESSING LETTERS, 2011, 111 (13) : 621 - 625
  • [30] The Shortest Covering Path Problem: A New Perspective and Model
    Niblett, Timothy J.
    Church, Richard L.
    INTERNATIONAL REGIONAL SCIENCE REVIEW, 2016, 39 (01) : 131 - 151
12345