On the public citation graph
The slab dividing approach to solve the EuclideanP-Center problem
0 signed · 84 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/1520-6750(198704)34:2<229::aid-nav3220340207>3.0.co;2-1openalex-snapshot
On the rectangularp-center problem
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/978-3-642-69897-2openalex-snapshot
Data Structures and Algorithms 2
inferredcites →https://doi.org/10.1057/jors.1984.150openalex-snapshot
The p-Centre Problem—Heuristic and Optimal Algorithms
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/0209046openalex-snapshot
Applications of a Planar Separator Theorem
inferredcites →https://doi.org/10.1137/0212052openalex-snapshot
Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
inferredcites →https://doi.org/10.1137/0213014openalex-snapshot
On the Complexity of Some Common Geometric Location Problems
inferredcites →https://doi.org/10.1145/358841.358850openalex-snapshot
Multidimensional divide-and-conquer
inferredcites →https://doi.org/10.1287/mnsc.27.7.848openalex-snapshot
Note—On a Modified One-Center Model
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11603771_6openalex-snapshot
Placing a Given Number of Base Stations to Cover a Convex Region
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_10openalex-snapshot
Exact Algorithms and Approximation Schemes for Base Station Placement Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-10564-8_4openalex-snapshot
Topological Stability of Kinetic k-centers
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_12openalex-snapshot
On the Minimum Consistent Subset Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-41913-4_15openalex-snapshot
Clustering a 2d Pareto Front: P-center Problems Are Solvable in Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-030-75242-2_20openalex-snapshot
Covering a Set of Line Segments with a Few Squares
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_12openalex-snapshot
Covering Convex Polygons by Two Congruent Disks
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_28openalex-snapshot
Intersecting Disks Using Two Congruent Disks
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_18openalex-snapshot
Efficient k-Center Algorithms for Planar Points in Convex Position
inferred← citeshttps://doi.org/10.1007/978-3-031-49190-0_15openalex-snapshot
Variants of Euclidean k-Center Clusterings
inferred← citeshttps://doi.org/10.1007/978-3-319-48749-6_25openalex-snapshot
The Mixed Center Location Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-62389-4_40openalex-snapshot
Simple $$O(n~log^{2}~n)$$ Algorithms for the Planar 2-Center Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_72openalex-snapshot
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_27openalex-snapshot
The 2-Center Problem in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_48openalex-snapshot
Computing a Geodesic Two-Center of Points in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/pl00009311openalex-snapshot
A Near-Linear Algorithm for the Planar 2-Center Problem
inferred← citeshttps://doi.org/10.1007/s00453-001-0110-yopenalex-snapshot
Exact and Approximation Algorithms for Clustering
inferred← citeshttps://doi.org/10.1007/s10479-018-3025-6openalex-snapshot
On interval and circular-arc covering problems
inferred← citeshttps://doi.org/10.1007/s10878-017-0183-4openalex-snapshot
The mixed center location problem
inferred← citeshttps://doi.org/10.1007/s10878-017-0195-0openalex-snapshot
The connected disk covering problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2011.01.001openalex-snapshot
Solving the constrained p-center problem using heuristic algorithms
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.12.003openalex-snapshot
Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2018.02.008openalex-snapshot
The geodesic 2-center problem in a simple polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.05.001openalex-snapshot
Computing a geodesic two-center of points in a simple polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101936openalex-snapshot
Covering convex polygons by two congruent disks
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101966openalex-snapshot
Intersecting disks using two congruent disks
inferred← citeshttps://doi.org/10.1016/j.comnet.2015.09.019openalex-snapshot
Optimization algorithms for transmission range and actor movement in wireless sensor and actor networks
inferred← citeshttps://doi.org/10.1016/j.cor.2008.03.009openalex-snapshot
New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center problems
inferred← citeshttps://doi.org/10.1016/j.cor.2019.01.009openalex-snapshot
k-Balanced Center Location problem: A new multi-objective facility location problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.07.048openalex-snapshot
Covering moving points with anchored disks
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.04.034openalex-snapshot
An elliptical cover problem in drone delivery network design and its solution algorithms
inferred← citeshttps://doi.org/10.1016/j.ic.2008.04.004openalex-snapshot
Finding the conditional location of a median path on a tree
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.05.004openalex-snapshot
Efficient algorithm for placing a given number of base stations to cover a convex region
inferred← citeshttps://doi.org/10.1016/j.scient.2011.07.010openalex-snapshot
Solving the conditional and unconditional -center problem with modified harmony search: A real case study
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.06.037openalex-snapshot
The discrete and mixed minimax 2-center problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.03.026openalex-snapshot
Topological stability of kinetic k-centers
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.053openalex-snapshot
Covering a set of line segments with a few squares
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00402-7openalex-snapshot
A fast algorithm for the alpha-connected two-center decision problem
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00336-3openalex-snapshot
Fast stabbing of boxes in high dimensions
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00076-8openalex-snapshot
Generalized p-Center problems: Complexity results and approximation algorithms
inferred← citeshttps://doi.org/10.1023/b:mone.0000013626.53247.1copenalex-snapshot
Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1051/matecconf/201823203022openalex-snapshot
An Efficient Algorithm of the Planar 3-Center Problem for a set of the convex position points
inferred← citeshttps://doi.org/10.1080/0305215x.2025.2600326openalex-snapshot
Two hybrid genetic algorithms for the continuous p -centre problem
inferred← citeshttps://doi.org/10.1109/broadnets.2007.4550431openalex-snapshot
Retransmission in OBS networks with fiber delay lines
inferred← citeshttps://doi.org/10.1109/iccnc.2012.6167573openalex-snapshot
Simultaneous optimization of transmission range and actor movement in WSANs
inferred← citeshttps://doi.org/10.1109/icpads.2009.37openalex-snapshot
Optimizing Base Station Deployment in Wireless Sensor Networks Under One-hop and Multi-hop Communication Models
inferred← citeshttps://doi.org/10.1109/ispan.2004.1300466openalex-snapshot
Approximation algorithms design for disk partial covering problem
inferred← citeshttps://doi.org/10.1109/lcn.2011.6115194openalex-snapshot
Optimal transmission range for multi-hop communication in wireless sensor and actor networks
inferred← citeshttps://doi.org/10.1109/lcn.2012.6423675openalex-snapshot
Optimization trade-offs in the design of wireless sensor and actor networks
inferred← citeshttps://doi.org/10.1109/pdgc.2012.6449906openalex-snapshot
An artificial bee colony algorithm based approach to the constrained p-center problem
inferred← citeshttps://doi.org/10.1109/tcc.2013.4openalex-snapshot
Stratus: Load Balancing the Cloud for Carbon Emissions Control
inferred← citeshttps://doi.org/10.1142/s0218195911003597openalex-snapshot
THE ALIGNED K-CENTER PROBLEM
inferred← citeshttps://doi.org/10.1145/1400863.1400879openalex-snapshot
Modelling gateway placement in wireless networks
inferred← citeshttps://doi.org/10.1145/237218.237251openalex-snapshot
A near-linear algorithm for the planar 2-center problem
inferred← citeshttps://doi.org/10.1145/2996913.2996927openalex-snapshot
Finding multiple new optimal locations in a road network
inferred← citeshttps://doi.org/10.1145/299917.299918openalex-snapshot
Efficient algorithms for geometric optimization
inferred← citeshttps://doi.org/10.1145/336154.336182openalex-snapshot
On the continuous Weber and k -median problems (extended abstract)
inferred← citeshttps://doi.org/10.1145/3483425openalex-snapshot
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
inferred← citeshttps://doi.org/10.1145/3798129.3800753openalex-snapshot
Fine-Grained Complexity of Continuous Euclidean k-Center
inferred← citeshttps://doi.org/10.1145/570810.570818openalex-snapshot
Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks
inferred← citeshttps://doi.org/10.1155/2010/563156openalex-snapshot
On Deployment of Multiple Base Stations for Energy-Efficient Communication in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1287/opre.1040.0137openalex-snapshot
On the Continuous Fermat-Weber Problem
inferred← citeshttps://doi.org/10.14288/1.0051487openalex-snapshot
Geometric facility location under continuous motion: bounded-velocity approximations to the mobile Euclidean k-centre and k-median problems
inferred← citeshttps://doi.org/10.17169/refubium-8271openalex-snapshot
Stabbing and Covering Geometric Objects in the Plane
inferred← citeshttps://doi.org/10.3390/math11030748openalex-snapshot
Red–Blue k-Center Clustering with Distance Constraints
inferred← citeshttps://doi.org/10.3390/math9040453openalex-snapshot
Unified Polynomial Dynamic Programming Algorithms for P-Center Variants in a 2D Pareto Front
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2021.41openalex-snapshot
Separated Red Blue Center Clustering
inferred← citeshttps://doi.org/10.48550/arxiv.0902.3282openalex-snapshot
Computing k-Centers On a Line
inferred← citeshttps://doi.org/10.48550/arxiv.1908.09648openalex-snapshot
Planar p-center problems are solvable in polynomial time when clustering a Pareto Front
inferred← citeshttps://doi.org/10.48550/arxiv.1910.12177openalex-snapshot
Computing a Geodesic Two-Center of Points in a Simple Polygon
inferred← citeshttps://doi.org/10.48550/arxiv.2108.00707openalex-snapshot
Efficient covering of convex domains by congruent discs
inferred← citeshttps://doi.org/10.5555/314613.315040openalex-snapshot
Exact and approximation algorithms for clustering
inferred← citeshttps://doi.org/10.70675/58b108c1z146dz4d00zb68czbcff43ac57e3openalex-snapshot
Machine Learning for the distributed and dynamic management of a fleet of taxis and autonomous shuttles
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.