The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy (Q5138372): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58329976, #quickstatements; #temporary_batch_1719386330764
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Database Location in Computer Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating replicas of a database on a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993417 / rank
 
Normal rank

Revision as of 03:00, 24 July 2024

scientific article; zbMATH DE number 7281859
Language Label Description Also known as
English
The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy
scientific article; zbMATH DE number 7281859

    Statements

    The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy (English)
    0 references
    0 references
    0 references
    0 references
    3 December 2020
    0 references
    data replication
    0 references
    optimization
    0 references
    dynamic programming
    0 references
    NP-completeness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references