Cover Image

Realizing temporal transportation trees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mertzios, George B., Molter, Hendrik, Morawietz, Nils, Spirakis, Paul G.
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Temporal Graph Realization With Bounded Stretch
by: Mertzios, George B., et al.
Published: (2025)

Realizing temporal graphs from fastest travel times
by: Klobas, Nina, et al.
Published: (2023)

The Complexity of Transitively Orienting Temporal Graphs
by: Mertzios, George B., et al.
Published: (2021)

Maintaining Bipartite Colourings on Temporal Graphs on a Budget
by: Adamson, Duncan, et al.
Published: (2025)

Round-Delayed Amnesiac Flooding
by: Alafin, Oluwatobi, et al.
Published: (2026)

The Complexity of Temporal Vertex Cover in Small-Degree Graphs
by: Hamm, Thekla, et al.
Published: (2022)

Realization of Temporally Connected Graphs Based on Degree Sequences
by: Casteigts, Arnaud, et al.
Published: (2025)

Foremost, Fastest, Shortest: Temporal Graph Realization under Various Path Metrics
by: Cauvi, Justine, et al.
Published: (2025)

Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines
by: Heeger, Klaus, et al.
Published: (2024)

Exploration of Always $S$-Connected Temporal Graphs
by: Adamson, Duncan, et al.
Published: (2026)

Minimum Temporal Spanners in Happy Graphs
by: Casteigts, Arnaud, et al.
Published: (2026)

Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
by: Komusiewicz, Christian, et al.
Published: (2026)

Towards Settling the Complexity of the Lettericity Problem
by: Grobler, Mario, et al.
Published: (2026)

Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems
by: Grüttemeier, Niels, et al.
Published: (2025)

Collision-Free Robot Scheduling
by: Adamson, Duncan, et al.
Published: (2024)

Parameterized Analysis of Bribery in Challenge the Champ Tournaments
by: Chaudhary, Juhi, et al.
Published: (2024)

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
by: Kaul, Matthias, et al.
Published: (2024)

Treewidth Parameterized by Feedback Vertex Number
by: Molter, Hendrik, et al.
Published: (2025)

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
by: Herrmann, Anton, et al.
Published: (2025)

Algorithmic Aspects of Temporal Betweenness
by: Buß, Sebastian, et al.
Published: (2020)

Complexity of Local Search for Euclidean Clustering Problems
by: Manthey, Bodo, et al.
Published: (2023)

On the Complexity of Community-aware Network Sparsification
by: Herrendorf, Emanuel, et al.
Published: (2024)

How to Make Knockout Tournaments More Popular?
by: Chaudhary, Juhi, et al.
Published: (2023)

Fairness in Repetitive Scheduling
by: Hermelin, Danny, et al.
Published: (2021)

Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times
by: Balzereit, Kaja, et al.
Published: (2024)

Adaptive Manipulation for Coalitions in Knockout Tournaments
by: Chaudhary, Juhi, et al.
Published: (2024)

Fair Repetitive Interval Scheduling
by: Heeger, Klaus, et al.
Published: (2024)

Simple Realizability of Abstract Topological Graphs
by: Da Lozzo, Giordano, et al.
Published: (2024)

Improved exploration of temporal graphs
by: Bastide, Paul, et al.
Published: (2025)

Temporal Graph Reconfiguration for Always-Connected Graphs
by: Sievers, Paul, et al.
Published: (2025)

Theoretical insights and an experimental comparison of tango trees and multi-splay trees
by: Al-Adhami, Khaleel, et al.
Published: (2024)

Binary weights spanning trees and the $k$-red spanning tree problem in linear time
by: Hochbaum, Dorit S.
Published: (2024)

Temporal queries for dynamic temporal forests
by: Bilò, Davide, et al.
Published: (2024)

Nested and outlier embeddings into trees
by: Chawla, Shuchi, et al.
Published: (2026)

NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
by: Fairbairn, David L., et al.
Published: (2024)

Fast decremental tree sums in forests
by: Berendsohn, Benjamin Aram, et al.
Published: (2026)

Faster feasibility for dynamic flows and transshipments on temporal networks
by: Sheridan, Kristin, et al.
Published: (2024)

Grandchildren-weight-balanced binary search trees
by: Jugé, Vincent
Published: (2024)

Efficient top-down updates in AVL trees
by: Jugé, Vincent
Published: (2024)

Optimal bounds on a tree inference algorithm
by: Gardiner, Jack, et al.
Published: (2024)