Online facility assignment (Q5919330)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7152271

Language	Label	Description	Also known as
English	Online facility assignment	scientific article; zbMATH DE number 7152271

Statements

scholarly article

0 references

Online facility assignment (English)

0 references

Abu Reyan Ahmed

0 references

Md. Saidur Rahman

0 references

Stephen G. Kobourov

0 references

Theoretical Computer Science

0 references

publication date

16 January 2020

0 references

full work available at URL

http://hdl.handle.net/10150/628277

0 references

zbMATH Keywords

online facility assignment

0 references

greedy algorithms

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

On the history of the transportation and maximum flow problems

0 references

0 references

The Stepping Stone Method of Explaining Linear Programming Calculations in Transportation Problems

0 references

Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation

0 references

0 references

0 references

On the competitive ratio for online facility location

0 references

On min-max \(r\)-gatherings

0 references

On r-Gatherings on the Line

0 references

Competitive algorithms for server problems

0 references

A lower bound for two-server balancing algorithms

0 references

0 references

An Optimal On-Line Algorithm for <i>K</i> Servers on Trees

0 references

On the competitive ratio of the work function algorithm for the \(k\)-server problem

0 references

The 3-server problem in the plane.

0 references

The 2-evader problem

0 references

Combinatorial optimization. Polyhedra and efficiency (3 volumes)

0 references

On-line algorithms for weighted bipartite matching and stable marriages

0 references

Online Weighted Matching

0 references

Approximation and Online Algorithms

0 references

A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching

0 references

Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem

0 references

A $$o(n)$$-Competitive Deterministic Algorithm for Online Matching on a Line

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.tcs.2019.08.011

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5919330

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5919330&oldid=36552267"