A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem (Q727979): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Mário César San Felice / rank
Normal rank
 
Property / author
 
Property / author: Mário César San Felice / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-016-0115-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2280458302 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive algorithms for distributed data management. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Competitive Online Algorithms via a Primal—Dual Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected facility location via random facility sampling and core detouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual algorithm for online non-uniform facility location / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the competitive ratio for online facility location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation via cost sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost-sharing mechanisms for network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 6.55 factor primal-dual approximation algorithm for the connected facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 1.488 approximation algorithm for the uncapacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Metric Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Offline and online facility leasing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Online Connected Facility Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual algorithms for connected facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Network Design Algorithms via Hierarchical Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Approximation Algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 04:25, 13 July 2024

scientific article
Language Label Description Also known as
English
A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem
scientific article

    Statements

    A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem (English)
    0 references
    0 references
    0 references
    0 references
    21 December 2016
    0 references
    online algorithms
    0 references
    competitive analysis
    0 references
    connected facility location
    0 references
    Steiner tree
    0 references
    approximation algorithms
    0 references
    randomized algorithms
    0 references

    Identifiers