Group parking permit problems
From MaRDI portal
Publication:2184679
Recommendations
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2086941 (Why is no real title available?)
- A deterministic algorithm for online Steiner tree leasing
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A primal-dual algorithm for online non-uniform facility location
- A tight bound on approximating arbitrary metrics by tree metrics
- Algorithms for facility location problems with outliers. (Extended abstract)
- Approximation via cost sharing
- Competitive snoopy caching
- Dynamic Steiner Tree Problem
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
- Improved Approximation for Single-Sink Buy-at-Bulk
- Infrastructure Leasing Problems
- LAST but not least: online spanners for buy-at-bulk
- Leasing with uncertainty
- Lectures on matroids
- Logarithmic regret algorithms for online convex optimization
- Offline and online facility leasing
- On-line generalized Steiner problem
- Online network design algorithms via hierarchical decompositions
- Price fluctuation in online leasing
- Strict cost sharing schemes for Steiner forest
- The design of approximation algorithms
- Towards Flexible Demands in Online Leasing Problems
- Towards the price of leasing online
This page was built for publication: Group parking permit problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2184679)