Approximating multistage matching problems

DOI10.1007/978-3-030-79987-8_39OpenAlexW3184162842MaRDI QIDQ5918627

Tilo Wiedera, Markus Chimani, Niklas Troost

Publication date: 22 March 2022

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

Full work available at URL: https://arxiv.org/abs/2002.06887

zbMATH Keywords

approximation algorithmsperfect matchingstemporal graphs

Mathematics Subject Classification ID

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

Related Items (4)

Multistage vertex cover ⋮ Approximating multistage matching problems ⋮ A faster parameterized algorithm for temporal matching ⋮ A simple rounding scheme for multistage optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multistage graph problems on a global budget
• Matching theory
• Temporal vertex cover with a sliding time window
• Online multistage subset maximization problems
• Temporal matching
• Traveling Salesman Problems in Temporal Graphs
• Maximum matchings in general graphs through randomization
• Near-optimal fully-dynamic graph connectivity
• Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching
• Changing Bases: Multistage Optimization for Matroids and Matchings
• Fully Dynamic Matching in Bipartite Graphs
• Computing maximum matchings in temporal graphs.
• Multistage Vertex Cover
• Connectivity and inference problems for temporal networks

This page was built for publication: Approximating multistage matching problems