scientific article; zbMATH DE number 7238962
DOI10.4230/LIPICS.SWAT.2018.7zbMATH Open1477.68196MaRDI QIDQ5116470FDOQ5116470
Vangelis Th. Paschos, Evripidis Bampis, Bruno Escoffier, Michael Lampis
Publication date: 25 August 2020
Title of this publication is not available (Why is that?)
Recommendations
- Approximating multistage matching problems
- Approximating multistage matching problems
- Multilateral matching
- Algorithms and Computation
- Jointly stable matchings
- Jointly stable matchings
- Conditional stable matchings
- On the Problem of Multiple Matching
- Multiperiod matching
- On the operation of multiple matching markets
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Offline and online facility leasing
- Infrastructure Leasing Problems
- The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online
- Changing Bases: Multistage Optimization for Matroids and Matchings
- Facility Location in Evolving Metrics
- The power of recourse for online MST and TSP
- A theory and algorithms for combinatorial reoptimization
- On the Tradeoff between Stability and Fit
- Competitive Analysis via Regularization
- Unified algorithms for online learning and competitive analysis
- Dynamic Sum-Radii Clustering
- Dynamic Facility Location via Exponential Clocks
Cited In (20)
- A multistage view on 2-satisfiability
- Multistage graph problems on a global budget
- Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs
- Multistage knapsack
- A strategy of matching blocks at multi-levels
- Sliding window temporal graph coloring
- Approximating multistage matching problems
- A faster parameterized algorithm for temporal matching
- Approximating multistage matching problems
- Temporal matching
- Computing maximum matchings in temporal graphs
- Online multistage subset maximization problems
- Multistage vertex cover
- On Lagrangian relaxation for constrained maximization and reoptimization problems
- Cluster editing for multi-layer and temporal graphs
- Multistage \(s-t\) path: confronting similarity with dissimilarity
- A simple rounding scheme for multistage optimization
- Target-based computer-assisted orchestration: complexity and approximation algorithms
- LP-based algorithms for multistage minimization problems
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116470)
