On the public citation graph

Near-Optimal Solutions to a 2-Dimensional Placement Problem

0 signed · 50 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bfb0039164openalex-snapshot
A drum scheduling algorithm
inferredcites →https://doi.org/10.1016/s0019-9958(72)90211-2openalex-snapshot
Minimizing expected travel time on geometrical patterns by optimal probability rearrangements
inferredcites →https://doi.org/10.1137/0204021openalex-snapshot
Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
inferredcites →https://doi.org/10.1137/1014035openalex-snapshot
A Review of the Placement and Quadratic Assignment Problems
inferredcites →https://doi.org/10.1145/321765.321775openalex-snapshot
Placement of Records on a Secondary Storage Device to Minimize Access Time
inferredcites →https://doi.org/10.1145/321784.321790openalex-snapshot
On the Optimality of the Probability Ranking Scheme in Storage Applications
inferredcites →https://doi.org/10.1145/321832.321838openalex-snapshot
A Combinatorial Problem Related to Multimodule Memory Organizations
inferredcites →https://doi.org/10.1145/321906.321907openalex-snapshot
The Effect of a Capacity Constraint on the Minimal Cost of a Partition
inferredcites →https://doi.org/10.1145/362248.362257openalex-snapshot
On the near-optimality of the shortest-latency-time-first drum scheduling discipline
inferredcites →https://doi.org/10.1147/rd.172.0101openalex-snapshot
Bounds for Weight Balanced Trees

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.1975.5.1.45openalex-snapshot
On the Computational Complexity of Combinatorial Problems
inferred← citeshttps://doi.org/10.1007/11534273_16openalex-snapshot
Communication-Aware Processor Allocation for Supercomputers
inferred← citeshttps://doi.org/10.1007/3-540-07612-3_3openalex-snapshot
Data base research: A survey
inferred← citeshttps://doi.org/10.1007/978-3-642-11120-4_3openalex-snapshot
Computational Complexity of Combinatorial and Graph-Theoretic Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-36065-7_6openalex-snapshot
A Competitive Strategy for Distance-Aware Online Shape Allocation
inferred← citeshttps://doi.org/10.1007/978-3-642-69352-6_2openalex-snapshot
Two-Dimensional Storage
inferred← citeshttps://doi.org/10.1007/978-94-011-7557-9_20openalex-snapshot
The Quadratic Assignment Problem: A Brief Review
inferred← citeshttps://doi.org/10.1007/bf00979370openalex-snapshot
Near-optimal heuristics for an assignment problem in mass storage
inferred← citeshttps://doi.org/10.1007/bf02279814openalex-snapshot
Optimization and approximation algorithm for placement of records on linear storage devices
inferred← citeshttps://doi.org/10.1007/bfb0022496openalex-snapshot
On some discrete optimization problems in mass storage systems
inferred← citeshttps://doi.org/10.1007/s00453-007-9037-2openalex-snapshot
Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.09.004openalex-snapshot
Integer point sets minimizing average pairwise L1 distance: What is the optimal shape of a town?
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.02.050openalex-snapshot
A competitive strategy for distance-aware online shape allocation
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70820-3openalex-snapshot
Approximative Algorithms for Discrete Optimization Problems
inferred← citeshttps://doi.org/10.1063/1.2752008openalex-snapshot
Optimal shape of a blob
inferred← citeshttps://doi.org/10.1080/05695557808975184openalex-snapshot
The Layout of Divisible Activities on the Line
inferred← citeshttps://doi.org/10.1093/comjnl/37.10.873openalex-snapshot
Optimal arrangements of cartridges in carousel type mass storage systems
inferred← citeshttps://doi.org/10.1109/issoc.2010.5625542openalex-snapshot
Energy-aware run-time mapping for homogeneous NoC
inferred← citeshttps://doi.org/10.1109/pdcat.2014.34openalex-snapshot
Online Scheduling of Applications on 3D Stacked Large Chip Multiprocessor
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492570openalex-snapshot
Competitive access time via dynamic storage rearrangement
inferred← citeshttps://doi.org/10.1109/tc.2007.1028openalex-snapshot
Optimal Free-Space Management and Routing-Conscious Dynamic Placement for Reconfigurable Devices
inferred← citeshttps://doi.org/10.1109/tcad.2008.2003301openalex-snapshot
Energy- and Performance-Aware Incremental Mapping for Networks on Chip With Multiple Voltage Levels
inferred← citeshttps://doi.org/10.1111/itor.12893openalex-snapshot
A continuous districting model focusing on intra‐ and inter‐zonal squared distances and its Voronoi‐based heuristic
inferred← citeshttps://doi.org/10.1137/0204021openalex-snapshot
Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
inferred← citeshttps://doi.org/10.1137/0208039openalex-snapshot
Optimal and Near-Optimal Scheduling Algorithms for Batched Processing in Linear Storage
inferred← citeshttps://doi.org/10.1137/0209017openalex-snapshot
Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
inferred← citeshttps://doi.org/10.1137/0211008openalex-snapshot
Analysis of a General Mass Storage System
inferred← citeshttps://doi.org/10.1137/1019043openalex-snapshot
Average Distances in $l_p$ Disks
inferred← citeshttps://doi.org/10.1137/1020073openalex-snapshot
On the Average Distances in a Circular Disc
inferred← citeshttps://doi.org/10.1145/322077.322085openalex-snapshot
Dynamic Placement of Records in Linear Storage
inferred← citeshttps://doi.org/10.1145/356810.356814openalex-snapshot
Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage Systems
inferred← citeshttps://doi.org/10.1147/rd.236.0696openalex-snapshot
An Elementary Proof of Nonexistence of Isometries between ℓpk and ℓqk
inferred← citeshttps://doi.org/10.1147/rd.241.0075openalex-snapshot
On the Complexity of Permuting Records in Magnetic Bubble Memory Systems
inferred← citeshttps://doi.org/10.1287/mnsc.22.7.778openalex-snapshot
A Least Total Distance Facility Configuration Problem Involving Lattice Points
inferred← citeshttps://doi.org/10.1287/opre.26.5.718openalex-snapshot
Combinatorial Problems: Reductibility and Approximation
inferred← citeshttps://doi.org/10.1287/opre.27.5.952openalex-snapshot
Some Layout Problems on the Line with Interdistance Constraints and Costs
inferred← citeshttps://doi.org/10.1287/opre.29.2.371openalex-snapshot
On the One-Dimensional Space Allocation Problem
inferred← citeshttps://doi.org/10.24355/dbbs.084-201003241003-0openalex-snapshot
Algorithms for Packing Problems
inferred← citeshttps://doi.org/10.3138/infor.47.2.81openalex-snapshot
One-Dimensional Carousel Storage Problems: Applications, Review and Generalizations
inferred← citeshttps://doi.org/10.48550/arxiv.1304.5971openalex-snapshot
A Competitive Strategy for Distance-Aware Online Shape Allocation
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.