On the public citation graph

Approximation of geometric dispersion problems

https://doi.org/10.1007/bfb0053964
0 signed · 45 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.1002/net.3230250205openalex-snapshot
Simple heuristics for unit disk graphs
inferredcites →https://doi.org/10.1007/3-540-63397-9_12openalex-snapshot
A new exact algorithm for general orthogonal d-dimensional knapsack problems
inferredcites →https://doi.org/10.1007/bf02187706openalex-snapshot
Rectilinear planar layouts and bipolar orientations of planar graphs
inferredcites →https://doi.org/10.1007/bf02574677openalex-snapshot
The densest packing of equal circles into a parallel strip
inferredcites →https://doi.org/10.1007/pl00009314openalex-snapshot
Curved Hexagonal Packings of Equal Disks in a Circle
inferredcites →https://doi.org/10.1016/0012-365x(83)90128-0openalex-snapshot
Representing a planar graph by vertical lines joining different levels
inferredcites →https://doi.org/10.1016/0012-365x(93)e0230-2openalex-snapshot
New results in the packing of equal circles in a square
inferredcites →https://doi.org/10.1016/0020-0190(81)90111-3openalex-snapshot
Optimal packing and covering in the plane are NP-complete
inferredcites →https://doi.org/10.1016/0196-6774(81)90034-1openalex-snapshot
A algorithm for two-dimensional packing
inferredcites →https://doi.org/10.1016/0377-2217(89)90420-7openalex-snapshot
Analytical models for locating undesirable facilities
inferredcites →https://doi.org/10.1016/0377-2217(90)90297-oopenalex-snapshot
The discrete p-dispersion problem
inferredcites →https://doi.org/10.1016/0377-2217(93)e0278-6openalex-snapshot
An exact algorithm for general, orthogonal, two-dimensional knapsack problems
inferredcites →https://doi.org/10.1016/s0012-365x(97)00050-2openalex-snapshot
Dense packings of congruent circles in a circle
inferredcites →https://doi.org/10.1080/03155986.1991.11732157openalex-snapshot
Comparison Of Four Models For dispersing Facilities
inferredcites →https://doi.org/10.1109/sfcs.1996.548461openalex-snapshot
Approximate strip packing
inferredcites →https://doi.org/10.1137/0211025openalex-snapshot
Planar Formulae and Their Uses
inferredcites →https://doi.org/10.1137/0404048openalex-snapshot
Obnoxious Facility Location on Graphs
inferredcites →https://doi.org/10.1145/160985.161013openalex-snapshot
A compaction algorithm for non-convex polygons and its application
inferredcites →https://doi.org/10.1145/2455.214106openalex-snapshot
Approximation schemes for covering and packing problems in image processing and VLSI
inferredcites →https://doi.org/10.1287/moor.6.1.50openalex-snapshot
Location on Tree Networks: P-Centre and n-Dispersion Problems
inferredcites →https://doi.org/10.1287/opre.33.1.49openalex-snapshot
An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
inferredcites →https://doi.org/10.1287/opre.42.2.299openalex-snapshot
Heuristic and Special Case Algorithms for Dispersion Problems
inferredcites →https://doi.org/10.1287/trsc.12.2.107openalex-snapshot
Locating an Obnoxious Facility on a Network
inferredcites →https://doi.org/10.2307/2583458openalex-snapshot
Knapsack Problems: Algorithms and Computer Implementations
inferredcites →https://doi.org/10.37236/1223openalex-snapshot
Dense Packings of Equal Disks in an Equilateral Triangle
inferredcites →https://doi.org/10.37236/1240openalex-snapshot
Repeated Patterns of Dense Packings of Equal Disks in a Square

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.2000.1145openalex-snapshot
Approximation Algorithms for Dispersion Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-04651-4_45openalex-snapshot
Max-Min Dispersion on a Line
inferred← citeshttps://doi.org/10.1007/978-3-030-26176-4_24openalex-snapshot
Max-Min 3-Dispersion Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-59267-7_29openalex-snapshot
Dispersing and Grouping Points on Segments in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-031-27051-2_6openalex-snapshot
Away from Each Other
inferred← citeshttps://doi.org/10.1007/978-3-319-78455-7_20openalex-snapshot
Exact Algorithms for the Max-Min Dispersion Problem
inferred← citeshttps://doi.org/10.1007/978-981-95-4839-2_21openalex-snapshot
Max-Min Four-Dispersion Problems
inferred← citeshttps://doi.org/10.1007/s10878-020-00549-5openalex-snapshot
Max–min dispersion on a line
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.08.011openalex-snapshot
Dispersing and grouping points on planar segments
inferred← citeshttps://doi.org/10.1023/a:1009802105661openalex-snapshot
Facility Dispersion Problems Under Capacity and Cost Constraints
inferred← citeshttps://doi.org/10.1109/aici.2009.263openalex-snapshot
Fuzzy Multi-objective Programming Approach to Hazard Materials Treatment Center Location
inferred← citeshttps://doi.org/10.1109/icsssm.2011.5959473openalex-snapshot
A bi-objective model for hazard materials location and routing problem
inferred← citeshttps://doi.org/10.1145/378583.378672openalex-snapshot
Algorithms for congruent sphere packing and applications
inferred← citeshttps://doi.org/10.1515/eng-2017-0045openalex-snapshot
A polynomial algorithm for packing unit squares in a hypograph of a piecewise linear function
inferred← citeshttps://doi.org/10.1587/transfun.2019dmp0011openalex-snapshot
Efficient Algorithms for the Partial Sum Dispersion Problem
inferred← citeshttps://doi.org/10.1587/transfun.2020dmp0003openalex-snapshot
Max-Min 3-Dispersion Problems
inferred← citeshttps://doi.org/10.1587/transfun.2021dmp0004openalex-snapshot
Dispersion on Intervals
inferred← citeshttps://doi.org/10.1587/transinf.2019fcp0005openalex-snapshot
An Approximation Algorithm for the 2-Dispersion Problem
inferred← citeshttps://doi.org/10.1587/transinf.2021fcp0013openalex-snapshot
An O(n2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position
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.