scientific article; zbMATH DE number 7525448
From MaRDI portal
Publication:5075745
DOI10.4230/LIPIcs.ESA.2019.11MaRDI QIDQ5075745
Alexandre Teiller, Bruno Escoffier, Kevin Schewior, Evripidis Bampis
Publication date: 11 May 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (8)
Multistage graph problems on a global budget ⋮ Multistage \(s-t\) path: confronting similarity with dissimilarity ⋮ A multistage view on 2-satisfiability ⋮ Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs ⋮ Online multistage subset maximization problems ⋮ Approximating multistage matching problems ⋮ A simple rounding scheme for multistage optimization ⋮ Target-based computer-assisted orchestration: complexity and approximation algorithms
Cites Work
- The min-up/min-down unit commitment polytope
- A tight lower bound for online convex optimization with switching costs
- The Itinerant List Update problem
- Offline and online facility leasing
- Approximation schemes for a class of subset selection problems
- 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
- A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs
- Competitive Analysis via Regularization
- Infrastructure Leasing Problems
- The Power of Recourse for Online MST and TSP
This page was built for publication:
