scientific article; zbMATH DE number 7238962

DOI10.4230/LIPIcs.SWAT.2018.7zbMath1477.68196MaRDI QIDQ5116470

Vangelis Th. Paschos, Bruno Escoffier, Michael Lampis, Evripidis Bampis

Publication date: 25 August 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

perfect matchingmultistage optimizationtemporal optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (18)

Multistage knapsack ⋮ Multistage graph problems on a global budget ⋮ Multistage vertex cover ⋮ On Lagrangian relaxation for constrained maximization and reoptimization problems ⋮ Multistage \(s-t\) path: confronting similarity with dissimilarity ⋮ Computing maximum matchings in temporal graphs ⋮ A multistage view on 2-satisfiability ⋮ Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs ⋮ Unnamed Item ⋮ Temporal matching ⋮ Sliding window temporal graph coloring ⋮ Online multistage subset maximization problems ⋮ Approximating multistage matching problems ⋮ Approximating multistage matching problems ⋮ A faster parameterized algorithm for temporal matching ⋮ A simple rounding scheme for multistage optimization ⋮ Target-based computer-assisted orchestration: complexity and approximation algorithms ⋮ LP-based algorithms for multistage minimization problems

Cites Work

• Unnamed Item
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• A theory and algorithms for combinatorial reoptimization
• Offline and online facility leasing
• Unified Algorithms for Online Learning and Competitive Analysis
• Dynamic Sum-Radii Clustering
• The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online
• On the Tradeoff between Stability and Fit
• Dynamic Facility Location via Exponential Clocks
• Changing Bases: Multistage Optimization for Matroids and Matchings
• Facility Location in Evolving Metrics
• Competitive Analysis via Regularization
• Infrastructure Leasing Problems
• The Power of Recourse for Online MST and TSP

This page was built for publication: