An Approximation Algorithm To The File Allocation Problem In Computer Networks

Summary: O(N^3) approximation algorithm for file allocation in arbitrary networks using marginal-savings, marginal-cost and incremental-benefit rules. Proves an analytical worst-case approximation bound that generalizes Johnson–Chvátal set-cover results and compares to heuristics/IP. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 662
Venue: PODS
Year: 1983
Pagerank: -
Overall Rank: 14,316 | 0.51%
DOI: -

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
7,568	Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model	2019	PODS	5.6519497e-05
6,817	Near-Optimal Algorithms for Shared Filter Evaluation in Data Stream Systems	2008	SIGMOD	5.8233185e-05
9,270	Approximation Algorithms for Co-Clustering	2008	PODS	5.3572577e-05
6,363	Reading a Set of Disk Pages	1993	VLDB	5.963483e-05
6,570	Efficient Algorithms for Optimal Location Queries in Road Networks	2014	SIGMOD	5.8936139e-05
8,800	Noticeable Network Delay Minimization via Node Upgrades	2018	VLDB	5.4311509e-05
8,966	Algorithms for Data Migration with Cloning	2003	PODS	5.4076395e-05
7,560	Incremental File Reorganization Schemes	1985	VLDB	5.6533865e-05
13,068	File Allocation in Distributed Databases with Interaction between Files	1983	VLDB	5.1725247e-05
13,084	An Approximation Algorithm For A File-Allocation Problem In A Hierarchical Distributed System.	1980	SIGMOD	5.1725247e-05