Database Location in Computer Networks

From MaRDI portal
Publication:3890141

DOI10.1145/322217.322226zbMath0445.68071OpenAlexW1977879268MaRDI QIDQ3890141

Dorit S. Hochbaum, Marshall L. Fisher

Publication date: 1980

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322217.322226



Related Items

Lagrangean relaxation. (With comments and rejoinder)., An integer programming model for the allocation of databases in a distributed computer system, Efficient algorithms for the capacitated concentrator location problem, Exact approaches for static data segment allocation problem in an information network, Designing cost-effective content distribution networks, Unnamed Item, Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique, Parallel general prefix computations with geometric, algebraic, and other applications, Exact algorithms for the joint object placement and request routing problem in content distribution networks, The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy, Dynamic replication of web contents, Facility location models to locate data in information networks: a literature review, A dual ascent approach for steiner tree problems on a directed graph, The multicovering problem, Facility location models for distribution system design, Optimization of resource location in hierarchical computer networks, On page migration and other relaxed task systems, Valid inequalities and facets of the capacitated plant location problem, Modeling and Managing Uncertainty in Process Planning and Scheduling, A constrained nonlinear 0-1 program for data allocation, Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization, Models for planning capacity expansion in local access telecommunication networks