Cardinality constrained Path Covering Problems in grid graphs

被引：2
|
作者：
Apollonio, N
Caccetta, L
Simeone, B
机构：
[1] Univ Roma La Sapienza, Dept Stat Probabil & Appl Stat, I-00185 Rome, Italy
[2] Curtin Univ Technol, Dept Math & Stat, Perth, WA 6001, Australia
来源：
NETWORKS | 2004年 / 44卷 / 02期
关键词：
graphs; grids; path covering; algorithms; complexity;
D O I：
10.1002/net.20022
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this article we continue our study on the complexity of Path Covering Problems started in [2]. Here, taking one further step, we investigate the complexity of the problem on grids. For special classes of grids (general grids, grids with a fixed number of rows, ladders), and several special unweighted path collections (general paths, paths of length 2, L-shaped paths, pipes, hooks, staples) we either give polynomial-time algorithms or prove NP-completeness results. (C) 2004 Wiley Periodicals, Inc.
引用
收藏
页码：120 / 131
页数：12
相关论文
共 50 条
  • [1] Reachability problems in interval-constrained and cardinality-constrained graphs
    Velasquez, Alvaro
    Subramani, K.
    Wojciechowski, Piotr
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2023, 15 (04)
  • [2] The cardinality-constrained shortest path problem in 2-graphs
    Dahl, G
    Realfsen, B
    [J]. NETWORKS, 2000, 36 (01) : 1 - 8
  • [3] The cardinality constrained covering traveling salesman problem
    Patterson, R
    Rolland, E
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (01) : 97 - 116
  • [4] A PTAS for the cardinality constrained covering with unit balls
    Ghasemi, Taha
    Razzazi, Mohammadreza
    [J]. THEORETICAL COMPUTER SCIENCE, 2014, 527 : 50 - 60
  • [5] On cardinality constrained cycle and path polytopes
    Kaibel, Volker
    Stephan, Ruediger
    [J]. MATHEMATICAL PROGRAMMING, 2010, 123 (02) : 371 - 394
  • [6] On cardinality constrained cycle and path polytopes
    Volker Kaibel
    Rüdiger Stephan
    [J]. Mathematical Programming, 2010, 123 : 371 - 394
  • [7] The Covering Path Problem on a Grid
    Zeng, Liwei
    Chopra, Sunil
    Smilowitz, Karen
    [J]. TRANSPORTATION SCIENCE, 2019, 53 (06) : 1656 - 1672
  • [8] Cardinality constrained bin‐packing problems
    H. Kellerer
    U. Pferschy
    [J]. Annals of Operations Research, 1999, 92 : 335 - 348
  • [9] Fixed-Parameter Algorithms for Cardinality-Constrained Graph Partitioning Problems on Sparse Graphs
    Yamada, Suguru
    Hanaka, Tesshu
    [J]. COMBINATORIAL OPTIMIZATION, ISCO 2024, 2024, 14594 : 220 - 232
  • [10] HYBRID HEURISTICS FOR MINIMUM CARDINALITY SET COVERING PROBLEMS
    VASKO, FJ
    WILSON, GR
    [J]. NAVAL RESEARCH LOGISTICS, 1986, 33 (02) : 241 - 249
12345