Traveling salesman problems in temporal graphs
From MaRDI portal
(Redirected from Publication:284573)
Recommendations
Cites work
- scientific article; zbMATH DE number 1617260 (Why is no real title available?)
- scientific article; zbMATH DE number 2147947 (Why is no real title available?)
- scientific article; zbMATH DE number 2086372 (Why is no real title available?)
- scientific article; zbMATH DE number 910871 (Why is no real title available?)
- scientific article; zbMATH DE number 961960 (Why is no real title available?)
- 8/7-approximation algorithm for (1,2)-TSP
- A Randomized Rounding Approach to the Traveling Salesman Problem
- An \(O(\log n/ \log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem
- An introduction to temporal graphs: an algorithmic perspective
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
- Computation in networks of passively mobile finite-state sensors
- Connectivity and inference problems for temporal networks
- Derandomized graph products
- Distributed computation in dynamic networks
- Efficient continuous-time dynamic network flow algorithms
- Flooding time in edge-Markovian dynamic graphs
- Graph colouring and the probabilistic method
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Mediated population protocols
- New inapproximability bounds for TSP
- On the complexity of information spreading in dynamic networks
- On the minimum label spanning tree problem
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
- Paths, Trees, and Flowers
- Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
- Shortest paths without a map
- Some Matching Problems for Bipartite Graphs
- Spanning trees with many or few colors in edge-colored graphs
- Temporal network optimization subject to connectivity constraints
- The Traveling Salesman Problem with Distances One and Two
- The complexity of satisfiability problems
- The labeled perfect matching in bipartite graphs
- Traveling salesman problems in temporal graphs
Cited in
(40)- A cop and robber game on edge-periodic temporal graphs
- Two moves per time step make a difference
- Disentangling the computational complexity of network untangling
- Traveling salesman problems in temporal graphs
- A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
- Temporal vertex cover with a sliding time window
- Deleting edges to restrict the size of an epidemic in temporal networks
- Faster exploration of degree-bounded temporal graphs
- On short fastest paths in temporal graphs
- Sliding window temporal graph coloring
- Deleting edges to restrict the size of an epidemic in temporal networks
- Temporal vertex cover with a sliding time window
- The complexity of finding small separators in temporal graphs
- On exploring always-connected temporal graphs of small pathwidth
- An LP-based approximation algorithm for the generalized traveling salesman path problem
- Exploration of the T-interval-connected dynamic graphs: the case of the ring
- Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs
- Temporal Traveling Salesman Problem – in a Logic- and Graph Theory-Based Depiction
- Temporal matching
- Exploring a Dynamic Ring Without Landmark
- Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks
- Exploration of dynamic cactuses with sub-logarithmic overhead
- The complexity of computing optimum labelings for temporal connectivity
- Exploration of \(k\)-edge-deficient temporal graphs
- Distributed exploration of dynamic rings
- Efficient live exploration of a dynamic ring with mobile robots
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable
- Exploring a dynamic ring without landmark
- Exploration of \(k\)-edge-deficient temporal graphs
- Exploration of dynamic networks: tight bounds on the number of agents
- Edge exploration of temporal graphs
- The temporal explorer who returns to the base
- Maximum 0-1 timed matching on temporal graphs
- Non-strict Temporal Exploration
- Königsberg sightseeing: Eulerian walks in temporal graphs
- On computing optimal temporal branchings and spanning subgraphs
- Eulerian walks in temporal graphs
- Optimizing reachability sets in temporal graphs by delaying
- Parameterised temporal exploration problems
- The complexity of finding small separators in temporal graphs
This page was built for publication: Traveling salesman problems in temporal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284573)
