Timeline cover in temporal graphs: exact and approximation algorithms

DOI10.1007/978-3-031-34347-6_15MaRDI QIDQ6182902FDOQ6182902

Authors:

Publication date: 22 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
• A better approximation ratio for the vertex cover problem
• Connectivity and inference problems for temporal networks
• \(O(\sqrt{\log n})\) approximation algorithms for Min UnCut, Min 2CNF deletion, and directed cut problems
• Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
• Optimal Long Code Test with One Free Bit
• An introduction to temporal graphs: an algorithmic perspective
• The network-untangling problem: from interactions to activity timelines
• The complexity of finding small separators in temporal graphs
• Temporal vertex cover with a sliding time window
• Königsberg sightseeing: Eulerian walks in temporal graphs
• The temporal explorer who returns to the base
• Edge exploration of temporal graphs

Cited In (3)

• Algorithms for Extracting Timeliness Graphs
• Temporal vertex cover with a sliding time window
• ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS

This page was built for publication: Timeline cover in temporal graphs: exact and approximation algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6182902)