The following pages link to Competitive snoopy caching (Q1103391):
Displaying 50 items.
- Online edge coloring of paths and trees with a fixed number of colors (Q1702302) (← links)
- Online dominating set (Q1741855) (← links)
- Online companion caching (Q1887084) (← links)
- New results for online page replication (Q1887086) (← links)
- The CNN problem and other \(k\)-server variants (Q1887095) (← links)
- Competitive distributed decision-making (Q1920425) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
- List factoring and relative worst order analysis (Q1950393) (← links)
- Online stochastic optimization under time constraints (Q1958625) (← links)
- Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304) (← links)
- Exact distributional analysis of online algorithms with lookahead (Q2044551) (← links)
- Guessing fractions of online sequences (Q2064290) (← links)
- Machine learning advised algorithms for the ski rental problem with a discount (Q2089688) (← links)
- The fast algorithm for online \(k\)-server problem on trees (Q2097225) (← links)
- Randomized strategies for non-additive 3-slope ski rental (Q2097335) (← links)
- Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence (Q2165267) (← links)
- The work function algorithm for the paging problem (Q2166767) (← links)
- Group parking permit problems (Q2184679) (← links)
- Online failure diagnosis in interdependent networks (Q2226505) (← links)
- On bin packing with clustering and bin packing with delays (Q2234744) (← links)
- Quantum online streaming algorithms with logarithmic memory (Q2241048) (← links)
- Probability-free solutions to the non-stationary newsvendor problem (Q2259048) (← links)
- Paging with request sets (Q2272199) (← links)
- An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones (Q2273650) (← links)
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm (Q2344206) (← links)
- Non-additive two-option ski rental (Q2345456) (← links)
- Rent or buy problems with a fixed time horizon (Q2345983) (← links)
- Online file caching with rejection penalties (Q2346958) (← links)
- Asymptotically optimal online page migration on three points (Q2350908) (← links)
- Online multi-coloring with advice (Q2355706) (← links)
- Competitive algorithms for the bicriteria \(k\)-server problem (Q2433801) (← links)
- Comparing online algorithms for bin packing problems (Q2434261) (← links)
- A new variable-sized bin packing problem (Q2434283) (← links)
- Calculating lower bounds for caching problems (Q2460920) (← links)
- Competitive analysis for the on-line truck transportation problem (Q2494309) (← links)
- Ramsey-type theorems for metric spaces with applications to online problems (Q2496321) (← links)
- The maximum resource bin packing problem (Q2508970) (← links)
- Relative interval analysis of paging algorithms on access graphs (Q2513607) (← links)
- Online search for a hyperplane in high-dimensional Euclidean space (Q2671802) (← links)
- An online algorithm for the inventory retrieval problem with an uncertain selling duration, uncertain prices, and price-dependent demands (Q2676392) (← links)
- Equilibria in online games (Q2796211) (← links)
- Weighted Online Problems with Advice (Q2819501) (← links)
- Engineering efficient paging algorithms (Q2828192) (← links)
- Bounds for Scheduling Jobs on Grid Processors (Q2848963) (← links)
- Online Bin Covering: Expectations vs. Guarantees (Q2867122) (← links)
- Non-Additive Two-Option Ski Rental (Q2868633) (← links)
- Stochastization of Weighted Automata (Q2946327) (← links)
- Optimal Online Edge Coloring of Planar Graphs with Advice (Q2947032) (← links)
- The Frequent Items Problem in Online Streaming Under Various Performance Measures (Q2947799) (← links)
- On Variants of File Caching (Q3012805) (← links)
