On the public citation graph
The Seat Reservation Problem
0 signed · 73 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jagm.1996.0821openalex-snapshot
Efficient On-Line Call Control Algorithms
inferredcites →https://doi.org/10.1006/jcss.1995.1021openalex-snapshot
Competitive Paging with Locality of Reference
inferredcites →https://doi.org/10.1007/3-540-61680-2_73openalex-snapshot
On-line competitive algorithms for call admission in optical networks
inferredcites →https://doi.org/10.1007/bf01294260openalex-snapshot
On the power of randomization in on-line algorithms
inferredcites →https://doi.org/10.1109/istcs.1993.253460openalex-snapshot
Efficient on-line call control algorithms
inferredcites →https://doi.org/10.1137/0201013openalex-snapshot
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
inferredcites →https://doi.org/10.1137/s0097539796299540openalex-snapshot
Beyond Competitive Analysis
inferredcites →https://doi.org/10.1145/100216.100262openalex-snapshot
An optimal algorithm for on-line bipartite matching
inferredcites →https://doi.org/10.1145/195058.195119openalex-snapshot
Efficient routing in all-optical networks
inferredcites →https://doi.org/10.1145/225058.225279openalex-snapshot
Bandwidth allocation with preemption
inferredcites →https://doi.org/10.5555/314464.314510openalex-snapshot
Competitive non-preemptive call control
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1099-1425(200009/10)3:5<273::aid-jos48>3.0.co;2-0openalex-snapshot
Applying extra-resource analysis to load balancing
inferred← citeshttps://doi.org/10.1006/jagm.2001.1198openalex-snapshot
Optimality and Greed in Dynamic Allocation
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_8openalex-snapshot
On-Line Edge-Coloring with a Fixed Number of Colors
inferred← citeshttps://doi.org/10.1007/3-540-44849-7_13openalex-snapshot
The Relative Worst Order Ratio for On-Line Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-44968-x_22openalex-snapshot
Better Bounds on the Accommodating Ratio for the Seat Reservation Problem
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_18openalex-snapshot
Fair versus Unrestricted Bin Packing
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_11openalex-snapshot
Extending the Accommodating Function
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_50openalex-snapshot
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_9openalex-snapshot
The Accomodating Function — A Generalization of the Competitive Ratio
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_13openalex-snapshot
Alternative Performance Measures in Online Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-18263-6_8openalex-snapshot
Online Multi-Coloring with Advice
inferred← citeshttps://doi.org/10.1007/978-3-319-98355-4_13openalex-snapshot
Relative Worst-Order Analysis: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_9openalex-snapshot
The Relative Worst Order Ratio Applied to Seat Reservation
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_16openalex-snapshot
Online Seat Reservations via Offline Seating Arrangements
inferred← citeshttps://doi.org/10.1007/978-3-540-77891-2_2openalex-snapshot
Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-15240-5_24openalex-snapshot
Improving the Competitive Ratios of the Seat Reservation Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_13-2openalex-snapshot
Alternative Performance Measures in Online Algorithms
inferred← citeshttps://doi.org/10.1007/978-981-96-2697-7_38openalex-snapshot
A Hybrid Optimal Strategy for Improved Seat Selection and Revenue Growth of the Rental Vehicles
inferred← citeshttps://doi.org/10.1007/978-981-96-3253-4_10openalex-snapshot
Effective Resource Allocation and Revenue Generation for Rental Vehicles
inferred← citeshttps://doi.org/10.1007/s00236-003-0124-9openalex-snapshot
Extending the accommodating function
inferred← citeshttps://doi.org/10.1007/s00236-016-0283-0openalex-snapshot
Online edge coloring of paths and trees with a fixed number of colors
inferred← citeshttps://doi.org/10.1007/s00453-002-0965-6openalex-snapshot
Fair versus Unrestricted Bin Packing
inferred← citeshttps://doi.org/10.1007/s00453-002-0992-3openalex-snapshot
On-Line Edge-Coloring with a Fixed Number of Colors
inferred← citeshttps://doi.org/10.1007/s12351-023-00786-6openalex-snapshot
Optimisation of seat reservations on trains to minimise transfer distances
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.01.049openalex-snapshot
Fixed interval scheduling: Models, applications, computational complexity and algorithms
inferred← citeshttps://doi.org/10.1016/j.ejor.2010.05.019openalex-snapshot
Competitive analysis of the online inventory problem
inferred← citeshttps://doi.org/10.1016/j.endm.2006.06.069openalex-snapshot
Competitive Algorithms for Cottage Rental
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.02.002openalex-snapshot
Seat reservation allowing seat changes
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.03.001openalex-snapshot
The relative worst-order ratio applied to paging
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.06.044openalex-snapshot
Online multi-coloring with advice
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00163-xopenalex-snapshot
Seat Reservation Allowing Seat Changes
inferred← citeshttps://doi.org/10.1023/a:1022985808959openalex-snapshot
Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem
inferred← citeshttps://doi.org/10.1057/rpm.2012.10openalex-snapshot
A passenger revenue management system (RMS) for a National Railway in an Emerging Asian Economy
inferred← citeshttps://doi.org/10.1109/access.2019.2948322openalex-snapshot
The Offline Group Seat Reservation Knapsack Problem With Profit on Seats
inferred← citeshttps://doi.org/10.1137/s0097539799361786openalex-snapshot
The Accommodating Function: A Generalization of the Competitive Ratio
inferred← citeshttps://doi.org/10.1142/s0129054105003042openalex-snapshot
ON-LINE SEAT RESERVATIONS VIA OFF-LINE SEATING ARRANGEMENTS
inferred← citeshttps://doi.org/10.1145/1027914.1027930openalex-snapshot
SIGACT news online algorithms column 4
inferred← citeshttps://doi.org/10.1145/1086649.1086670openalex-snapshot
SIGACT news online algorithms column 8
inferred← citeshttps://doi.org/10.1145/1240233.1240245openalex-snapshot
The relative worst order ratio for online algorithms
inferred← citeshttps://doi.org/10.1145/1383369.1383379openalex-snapshot
The relative worst order ratio applied to seat reservation
inferred← citeshttps://doi.org/10.1145/1620491.1620508openalex-snapshot
SIGACT news online algorithms column 14
inferred← citeshttps://doi.org/10.1145/1711475.1711499openalex-snapshot
Introduction to the SIGACT news online algorithms column
inferred← citeshttps://doi.org/10.1145/1711475.1714372openalex-snapshot
On Developing New Models, with Paging as a Case Study
inferred← citeshttps://doi.org/10.1145/1753171.1753194openalex-snapshot
SIGACT news online algorithms column 16
inferred← citeshttps://doi.org/10.1145/1907450.1907547openalex-snapshot
SIGACT news online algorithms column 17
inferred← citeshttps://doi.org/10.1145/1998037.1998057openalex-snapshot
SIGACT news online algorithms column 19
inferred← citeshttps://doi.org/10.1145/954092.954104openalex-snapshot
SIGACT news online algorithms column 1
inferred← citeshttps://doi.org/10.3929/ethz-a-007089360openalex-snapshot
Advice and Randomization in Online Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1405.3817openalex-snapshot
Online Edge Coloring of Paths and Trees with a Fixed Number of Colors
inferred← citeshttps://doi.org/10.5555/1070432.1070534openalex-snapshot
The relative worst order ratio applied to paging
inferred← citeshttps://doi.org/10.5555/338219.338606openalex-snapshot
Applying extra-resource analysis to load balancing
inferred← citeshttps://doi.org/10.70675/9976a622z13e6z4feaz8d69zbb5172afa95aopenalex-snapshot
Performance guaranteeing algorithms for solving online decision problems in financial systems
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.