Timeline cover in temporal graphs: exact and approximation algorithms

DOI10.1007/978-3-031-34347-6_15MaRDI QIDQ6182902zbMATH OpenFDO

Authors

Publication date 22 December 2023

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

Full work available at URL https://doi.org/10.1007/978-3-031-34347-6_15

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(7)

• Temporal vertex cover with a sliding time window
• Algorithms for Extracting Timeliness Graphs
• ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS
• An FPT algorithm for temporal graph untangling
• An FPT algorithm for timeline cover
• Exact and approximation algorithms for covering timeline in temporal graphs
• How to reduce temporal cliques to find sparse spanners

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)