This paper shows for both strict and non-strict temporal paths that RTC is NP-complete for any combination of k ≥ 1 and δ ≥ 1 and W [1]-hard for parameter solution size or vertex interval membership width plus pathwidth of the underlying graph.
It is shown that bidirectional Dijkstra is still instance-optimal on simple undirected weighted graphs under the order-oblivious model, where incident edges are given in a random order, and under the order-dependent model, where bidirectional Dijkstra is not instance-optimal.
This work studies the unambiguous complexity of the Long Path problem on DAGs under parameterization and obtains an algorithm that achieves unambiguous and co-unambiguous O ( k log n ) space while running in time polynomial in both n and k.
It is proved that the problem of defining a bounded cost set of nodes S such that the influence spreading from S in G, within a given time bound, is as large as possible, and that the problem is NP-hard, even in simple networks like complete graphs and trees.
This paper generalises the existing PTAS for complete graphs from a fixed to an arbitrary number of intervals and disprove an existing conjecture, which states that every instance of BIA admits a solution satisfying at least three quarters of all edges.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
