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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): journals/dc/CookPP02, #quickstatements; #temporary_batch_1732532539753
 
(3 intermediate revisions by 3 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s446-002-8031-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002043779 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58329976 / rank
 
Normal rank
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
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/dc/CookPP02 / rank
 
Normal rank

Latest revision as of 12:06, 25 November 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