Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits

Type: Book-Chapter

Publication Date: 2017-12-21

Citations: 11

DOI: https://doi.org/10.1007/978-3-319-73117-9_26

Locations

  • Lecture notes in computer science - View
  • arXiv (Cornell University) - View - PDF

Similar Works

Action Title Year Authors
+ PDF Chat Non-crossing Paths with Geographic Constraints 2018 Rodrigo I. Silveira
Bettina Speckmann
Kevin Verbeek
+ Distribution of crossings in restricted paths 1971 Kanwar Sen
+ PDF Chat Intersection Graphs of Non-crossing Paths 2019 Steven Chaplick
+ PDF Chat Approximating the shortest path problem with scenarios 2024 Adam Kasperski
Paweł Zieliński
+ A note on 3-Steiner intervals and betweenness 2011 Manoj Changat
Anandavally K. Lakshmikuttyamma
J. Howard Mathews
Iztok Peterin
Prasanth G. Narasimha-Shenoi
Aleksandra Tepeh
+ PDF Chat A Flexible Approach for Finding Optimal Paths with Minimal Conflicts 2017 Juliana Bowles
Marco B. Caminati
+ Optimum Arrangement Of Points 2015 Derek Blunt
+ PDF Chat Computing and Listing Avoidable Vertices and Paths 2022 Charis Papadopoulos
Th. Zisis
+ PDF Chat Balancing minimum spanning trees and shortest-path trees 1995 Samir Khuller
Balaji Raghavachari
Neal E. Young
+ PDF Chat Parameterizing Path Partitions 2023 Henning Fernau
Florent Foucaud
Kevin Mann
Utkarsh Padariya
K. N. Rajath Rao
+ Parameterizing Path Partitions 2024 Henning Fernau
Florent Foucaud
Kevin Mann
Utkarsh Padariya
Rajath Rao K.N.
+ Intersection of longest paths 2011 Scott Kensell
+ PDF Chat Makespan Trade-Offs for Visiting Triangle Edges 2021 Konstantinos Georgiou
Somnath Kundu
Paweł Prałat
+ Enumeration of higher-dimensional paths under restrictions 1979 B.R. Handa
S. G. Mohanty
+ PDF Chat Non-crossing Shortest Paths Lengths in Planar Graphs in Linear Time 2023 Lorenzo Balzotti
Paolo Giulio Franciosa
+ PDF Chat Dispersing points on intervals 2018 Shimin Li
Haitao Wang
+ PDF Chat Finding Two Edge-Disjoint Paths with Length Constraints 2016 Leizhen Cai
Junjie Ye
+ PDF Chat Decomposing a graph with shortest paths of bounded eccentricity 2018 Léo Planche
+ Shortest paths 2014 Aad Goddijn
Martin Kindt
W Reuter
+ PDF Chat Approximating Survivable Networks with Minimum Number of Steiner Points 2011 Lior Kamma
Zeev Nutov