Approximating multistage matching problems

DOI10.1007/s00453-022-00951-xOpenAlexW3006290891MaRDI QIDQ5918760

Markus Chimani, Tilo Wiedera, Niklas Troost

Publication date: 3 August 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-022-00951-x

zbMATH Keywords

approximation algorithmsperfect matchingstemporal graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Related Items (1)

Computing maximum matchings in temporal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multistage graph problems on a global budget
• Matching theory
• Temporal vertex cover with a sliding time window
• LP-based algorithms for multistage minimization problems
• Multistage vertex cover
• Temporal matching
• Traveling Salesman Problems in Temporal Graphs
• Maximum matchings in general graphs through randomization
• Near-optimal fully-dynamic graph connectivity
• Fully Dynamic Matching in Bipartite Graphs
• Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching
• Changing Bases: Multistage Optimization for Matroids and Matchings
• Assessing the Computational Complexity of Multi-layer Subgraph Detection
• Computing maximum matchings in temporal graphs.
• Connectivity and inference problems for temporal networks
• Approximating multistage matching problems

This page was built for publication: Approximating multistage matching problems