Changing Bases: Multistage Optimization for Matroids and Matchings
From MaRDI portal
Publication:5167773
DOI10.1007/978-3-662-43948-7_47zbMath1423.90067arXiv1404.3768OpenAlexW1594302759MaRDI QIDQ5167773
Udi Wieder, Anupam Gupta, Kunal Talwar
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.3768
approximationperfect matchingmultistage combinatorial optimization problemmultistage matroid maintenance problem
Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial optimization (90C27)
Related Items (26)
Multistage knapsack ⋮ Multistage graph problems on a global budget ⋮ Multistage vertex cover ⋮ Maximum 0-1 timed matching on temporal graphs ⋮ Multistage robust discrete optimization via quantified integer programming ⋮ Multistage online maxmin allocation of indivisible entities ⋮ Online 2-stage stable matching ⋮ Multistage \(s-t\) path: confronting similarity with dissimilarity ⋮ Computing maximum matchings in temporal graphs ⋮ A multistage view on 2-satisfiability ⋮ Reallocating multiple facilities on the line ⋮ Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Sliding window temporal graph coloring ⋮ Online multistage subset maximization problems ⋮ Unified Algorithms for Online Learning and Competitive Analysis ⋮ Approximating multistage matching problems ⋮ Approximating multistage matching problems ⋮ Unnamed Item ⋮ A faster parameterized algorithm for temporal matching ⋮ A Combinatorial Metrical Task System Problem Under the Uniform Metric ⋮ A simple rounding scheme for multistage optimization ⋮ Target-based computer-assisted orchestration: complexity and approximation algorithms ⋮ Facility reallocation on the line ⋮ LP-based algorithms for multistage minimization problems
This page was built for publication: Changing Bases: Multistage Optimization for Matroids and Matchings
