Group parking permit problems
From MaRDI portal
Publication:2184679
DOI10.1016/j.dam.2019.05.013zbMath1439.90071OpenAlexW2949880288WikidataQ127681215 ScholiaQ127681215MaRDI QIDQ2184679
Orlando Lee, Mário César San Felice, Murilo S. de Lima
Publication date: 29 May 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.05.013
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Towards the price of leasing online
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A primal-dual algorithm for online non-uniform facility location
- Logarithmic regret algorithms for online convex optimization
- Competitive snoopy caching
- Cost-efficient scheduling on machines from the cloud
- Price fluctuation in online leasing
- Offline and online facility leasing
- On-line generalized Steiner problem
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
- A deterministic algorithm for online Steiner tree leasing
- The Design of Approximation Algorithms
- Towards Flexible Demands in Online Leasing Problems
- Approximation via cost sharing
- Dynamic Steiner Tree Problem
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- LAST but not Least: Online Spanners for Buy-at-Bulk
- Leasing with Uncertainty
- Online Network Design Algorithms via Hierarchical Decompositions
- Strict Cost Sharing Schemes for Steiner Forest
- Infrastructure Leasing Problems
- Improved Approximation for Single-Sink Buy-at-Bulk
- Lectures on matroids
- A tight bound on approximating arbitrary metrics by tree metrics
This page was built for publication: Group parking permit problems
