Monitoring graph edges via shortest paths: computational complexity and approximation algorithms

Documenti analoghi

• On graphs coverable by k shortest paths
  di: Dumas, Maël, et al.
  Pubblicazione: (2022)
• Centrality of shortest paths: Algorithms and complexity results
  di: Phosavanh, Johnson, et al.
  Pubblicazione: (2024)
• On the (In)Approximability of the Monitoring Edge Geodetic Set Problem
  di: Bilò, Davide, et al.
  Pubblicazione: (2025)
• On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets
  di: Bilò, Davide, et al.
  Pubblicazione: (2024)
• Phase transition in the computational complexity of the shortest common superstring and genome assembly
  di: Fernandez, L. A., et al.
  Pubblicazione: (2022)