scientific article; zbMATH DE number 7238962
From MaRDI portal
Publication:5116470
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)
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
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A theory and algorithms for combinatorial reoptimization
- Changing bases: multistage optimization for matroids and matchings
- Competitive analysis via regularization
- Dynamic facility location via exponential clocks
- Dynamic sum-radii clustering
- Facility location in evolving metrics
- Infrastructure Leasing Problems
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Offline and online facility leasing
- On the tradeoff between stability and fit
- The power of deferral: maintaining a constant-competitive Steiner tree online
- The power of recourse for online MST and TSP
- Unified algorithms for online learning and competitive analysis
Cited in
(21)- 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
- Changing bases: multistage optimization for matroids and matchings
- A faster parameterized algorithm for temporal matching
- Temporal matching
- Approximating multistage matching problems
- 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
- scientific article; zbMATH DE number 7561666 (Why is no real title available?)
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)
