scientific article; zbMATH DE number 7525448
From MaRDI portal
Publication:5075745
Recommendations
- Online multistage subset maximization problems
- Online submodular minimization
- Online Submodular Maximization Problem with Vector Packing Constraint.
- Online Combinatorial Optimization Problems with Non-linear Objectives
- The Online Submodular Cover Problem
- Multistage online maxmin allocation of indivisible entities
- Online submodular maximization with preemption
- Online submodular maximization with preemption
- scientific article; zbMATH DE number 1487870
- Structured Robust Submodular Maximization: Offline and Online Algorithms
Cites work
- A 2-competitive algorithm for online convex optimization with switching costs
- A tight lower bound for online convex optimization with switching costs
- Approximation schemes for a class of subset selection problems
- 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
- Offline and online facility leasing
- On the tradeoff between stability and fit
- The itinerant list update problem
- The min-up/min-down unit commitment polytope
- 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
(11)- A multistage view on 2-satisfiability
- scientific article; zbMATH DE number 1670658 (Why is no real title available?)
- Multistage graph problems on a global budget
- Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs
- Approximating multistage matching problems
- Online Submodular Maximization Problem with Vector Packing Constraint.
- Online multistage subset maximization problems
- Multistage \(s-t\) path: confronting similarity with dissimilarity
- Online Algorithms for Multilevel Aggregation
- A simple rounding scheme for multistage optimization
- Target-based computer-assisted orchestration: complexity and approximation algorithms
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 Q5075745)
