Online facility assignment for general layout of servers on a line

DOI10.1007/978-3-031-49614-1_23MaRDI QIDQ6606242FDOQ6606242

Authors Tsubasa Harada, Toshiya Itoh

Publication date 16 September 2024

zbMATH Keywords

greedy algorithmcompetitive analysisonline algorithmonline metric matchingonline facility assignmentonline matching on a line

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites work

• scientific article; zbMATH DE number 7236471 (Why is no real title available?)
• A collection of lower bounds for online matching on the line
• An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching
• Competitive analysis for two variants of online metric matching problem
• Matching on the Line Admits no \(o(\sqrt {\log n})\) -Competitive Algorithm
• On-line algorithms for weighted bipartite matching and stable marriages
• Online Weighted Matching
• Online facility assignment
• The Online Metric Matching Problem for Doubling Metrics
• The Online Transportation Problem
• The Online Transportation Problem: On the Exponential Boost of One Extra Server

This page was built for publication: Online facility assignment for general layout of servers on a line

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606242)