On the public citation graph

The Parking Permit Problem

0 signed · 82 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jagm.2000.1129openalex-snapshot
Placement Algorithms for Hierarchical Cooperative Caching
inferredcites →https://doi.org/10.1109/sfcs.1996.548477openalex-snapshot
Probabilistic approximation of metric spaces and its algorithmic applications
inferredcites →https://doi.org/10.1109/sfcs.1997.646143openalex-snapshot
Buy-at-bulk network design
inferredcites →https://doi.org/10.1109/sfcs.2002.1181956openalex-snapshot
A constant-factor approximation algorithm for the multicommodity rent-or-buy problem
inferredcites →https://doi.org/10.1109/sfcs.2003.1238233openalex-snapshot
Approximation via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem
inferredcites →https://doi.org/10.1145/258533.258618openalex-snapshot
On-line algorithms for Steiner tree problems (extended abstract)
inferredcites →https://doi.org/10.1145/276698.276725openalex-snapshot
On approximating arbitrary metrices by tree metrics
inferredcites →https://doi.org/10.1145/780542.780558openalex-snapshot
The online set cover problem
inferredcites →https://doi.org/10.1145/780542.780608openalex-snapshot
A tight bound on approximating arbitrary metrics by tree metrics
inferredcites →https://doi.org/10.1145/780555.780558openalex-snapshot
The online set cover problem
inferredcites →https://doi.org/10.5555/314161.314397openalex-snapshot
Buy-at-bulk network design: approximating the single-sink edge installation problem
inferredcites →https://doi.org/10.5555/365411.365479openalex-snapshot
Web caching using access statistics
inferredcites →https://doi.org/10.5555/545381.545394openalex-snapshot
Improved algorithms for the data placement problem

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11561071_61openalex-snapshot
Online Primal-Dual Algorithms for Covering and Packing Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-75242-2_5openalex-snapshot
Algorithms for Energy Conservation in Heterogeneous Data Centers
inferred← citeshttps://doi.org/10.1007/978-3-030-96731-4_18openalex-snapshot
Machine Learning Advised Ski Rental Problem with a Discount
inferred← citeshttps://doi.org/10.1007/978-3-031-08965-7_9openalex-snapshot
Online Algorithms for Prize-Collecting Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-10725-2_1openalex-snapshot
Approaching Set Cover Leasing, Connected Dominating Set and Related Problems with Online Deterministic Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-37228-5_7openalex-snapshot
Online Facility Location Problems Inspired by the COVID-19 Pandemic
inferred← citeshttps://doi.org/10.1007/978-3-031-37228-5_8openalex-snapshot
An Online Variant of Set Cover Inspired by Happy Clients
inferred← citeshttps://doi.org/10.1007/978-3-031-43421-1_20openalex-snapshot
Online State Exploration: Competitive Worst Case and Learning-Augmented Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-62792-7_8openalex-snapshot
A Learning-Augmented Algorithm for the Parking Permit Problem with Three Permit Types
inferred← citeshttps://doi.org/10.1007/978-3-319-09620-9_1openalex-snapshot
Algorithmic Aspects of Resource Management in the Cloud
inferred← citeshttps://doi.org/10.1007/978-3-319-12691-3_3openalex-snapshot
Randomized Online Algorithms for Set Cover Leasing Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_22openalex-snapshot
Towards Flexible Demands in Online Leasing Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-48749-6_42openalex-snapshot
Cost-Efficient Scheduling on Machines from the Cloud
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_15openalex-snapshot
A Deterministic Algorithm for Online Steiner Tree Leasing
inferred← citeshttps://doi.org/10.1007/978-3-319-71147-8_2openalex-snapshot
Price Fluctuation in Online Leasing
inferred← citeshttps://doi.org/10.1007/978-3-319-89920-6_57openalex-snapshot
Leasing with Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-319-94667-2_18openalex-snapshot
An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest
inferred← citeshttps://doi.org/10.1007/978-3-540-68891-4_21openalex-snapshot
Offline and Online Facility Leasing
inferred← citeshttps://doi.org/10.1007/978-3-540-72792-7_32openalex-snapshot
Infrastructure Leasing Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-31104-8_6openalex-snapshot
An Algorithm for Online Facility Leasing
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_36openalex-snapshot
Online Sum-Radii Clustering
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_33openalex-snapshot
Rent or Buy Problems with a Fixed Time Horizon
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_47openalex-snapshot
Changing Bases: Multistage Optimization for Matroids and Matchings
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_57openalex-snapshot
Online Appointment Scheduling in the Random Order Model
inferred← citeshttps://doi.org/10.1007/s00224-014-9552-xopenalex-snapshot
Rent or Buy Problems with a Fixed Time Horizon
inferred← citeshttps://doi.org/10.1007/s00224-023-10126-yopenalex-snapshot
Non-Linear Ski Rental
inferred← citeshttps://doi.org/10.1007/s00453-018-0420-yopenalex-snapshot
Towards Flexible Demands in Online Leasing Problems
inferred← citeshttps://doi.org/10.1007/s00453-021-00888-7openalex-snapshot
Tight Bounds for Online Weighted Tree Augmentation
inferred← citeshttps://doi.org/10.1007/s10878-015-9915-5openalex-snapshot
Towards the price of leasing online
inferred← citeshttps://doi.org/10.1007/s10878-017-0198-xopenalex-snapshot
Cost-efficient scheduling on machines from the cloud
inferred← citeshttps://doi.org/10.1007/s10957-026-03062-7openalex-snapshot
Competitive analysis of the online leasing problem with a piecewise price function
inferred← citeshttps://doi.org/10.1007/s42979-022-01193-yopenalex-snapshot
Algorithmic Study of Online Multi-Facility Location Problems
inferred← citeshttps://doi.org/10.1016/j.dam.2019.05.013openalex-snapshot
Group parking permit problems
inferred← citeshttps://doi.org/10.1016/j.disopt.2013.10.001openalex-snapshot
Offline and online facility leasing
inferred← citeshttps://doi.org/10.1016/j.endm.2017.10.039openalex-snapshot
On Generalizations of the Parking Permit Problem and Network Leasing Problems
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.06.012openalex-snapshot
The ski-rental problem with multiple discount options
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103545openalex-snapshot
Online computation with untrusted advice
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.03.010openalex-snapshot
Online Sum-Radii Clustering
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.038openalex-snapshot
Non-additive two-option ski rental
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.10.009openalex-snapshot
Algorithms for energy conservation in heterogeneous data centers
inferred← citeshttps://doi.org/10.1109/access.2024.3406788openalex-snapshot
Online Algorithmic Study of Facility Location Problems: A Survey
inferred← citeshttps://doi.org/10.1109/icdcs.2015.18openalex-snapshot
Competitive Strategies for Online Cloud Resource Allocation with Discounts: The 2-Dimensional Parking Permit Problem
inferred← citeshttps://doi.org/10.1109/infocom.2016.7524616openalex-snapshot
On demand elastic capacity planning for service auto-scaling
inferred← citeshttps://doi.org/10.1109/itc30.2018.00014openalex-snapshot
Online Algorithms for Cost-Effective Cloud Selection with Multiple Demands
inferred← citeshttps://doi.org/10.1145/1122480.1122499openalex-snapshot
2005
inferred← citeshttps://doi.org/10.1145/1959045.1959065openalex-snapshot
Online and incremental algorithms for facility location
inferred← citeshttps://doi.org/10.1145/2465529.2465533openalex-snapshot
A tale of two metrics
inferred← citeshttps://doi.org/10.1145/2767386.2767454openalex-snapshot
Online Resource Leasing
inferred← citeshttps://doi.org/10.1145/2852040.2852058openalex-snapshot
PODC 2015 Review
inferred← citeshttps://doi.org/10.1145/3350755.3400280openalex-snapshot
Non-Linear Ski Rental
inferred← citeshttps://doi.org/10.1145/3763239openalex-snapshot
Improved Learning-Augmented Algorithms and (Tight) Lower Bounds for Multi-Option Ski Rental Problem
inferred← citeshttps://doi.org/10.1287/moor.1080.0363openalex-snapshot
Online Primal-Dual Algorithms for Covering and Packing
inferred← citeshttps://doi.org/10.14569/ijacsa.2011.020623openalex-snapshot
Algorithms for Content Distribution in Networks
inferred← citeshttps://doi.org/10.14778/3407790.3407834openalex-snapshot
Fast and effective distribution-key recommendation for amazon redshift
inferred← citeshttps://doi.org/10.1561/0400000024openalex-snapshot
The Design of Competitive Online Algorithms via a Primal—Dual Approach
inferred← citeshttps://doi.org/10.1561/9781601982179openalex-snapshot
The Design of Competitive Online Algorithms via a Primal—Dual Approach
inferred← citeshttps://doi.org/10.1587/transinf.2015fcp0005openalex-snapshot
Competitive Analysis for the Flat-Rate Problem
inferred← citeshttps://doi.org/10.1609/aaai.v35i13.17429openalex-snapshot
Competitive Analysis for Two-Level Ski-Rental Problem
inferred← citeshttps://doi.org/10.1609/icaps.v31i1.15985openalex-snapshot
Online Hedge Reservation for Diverse Plans and Competitive Analysis
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2019.88openalex-snapshot
Tight Bounds for Online Weighted Tree Augmentation
inferred← citeshttps://doi.org/10.47749/t/unicamp.2018.1014622openalex-snapshot
Parking permit and network leasing problems
inferred← citeshttps://doi.org/10.48550/arxiv.1109.5325openalex-snapshot
Online Sum-Radii Clustering
inferred← citeshttps://doi.org/10.48550/arxiv.1609.01184openalex-snapshot
Cost-efficient Scheduling on Machines from the Cloud
inferred← citeshttps://doi.org/10.48550/arxiv.1805.02994openalex-snapshot
Online Connected Dominating Set Leasing
inferred← citeshttps://doi.org/10.48550/arxiv.2002.05808openalex-snapshot
Online Algorithms for Multi-shop Ski Rental with Machine Learned Advice
inferred← citeshttps://doi.org/10.48550/arxiv.2205.08715openalex-snapshot
Customizing ML Predictions for Online Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.2407.17712openalex-snapshot
Improving Online Algorithms via ML Predictions
inferred← citeshttps://doi.org/10.5753/etc.2016.9837openalex-snapshot
On a Leasing Variant of the Online Connected Facility Location Problem
inferred← citeshttps://doi.org/10.65109/ocnn5096openalex-snapshot
Online Algorithms for Multi-shop Ski Rental with Machine Learned Predictions
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.