A study on two geometric location problems
From MaRDI portal
Publication:1122367
DOI10.1016/0020-0190(88)90174-3zbMath0675.68071OpenAlexW1975512711MaRDI QIDQ1122367
Publication date: 1988
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(88)90174-3
Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Other problems of combinatorial convexity (52A37) Discrete mathematics in relation to computer science (68R99)
Related Items (25)
A comparison of \(p\)-dispersion heuristics ⋮ Testing Consumer Rationality Using Perfect Graphs and Oriented Discs ⋮ Representation of the non-dominated set in biobjective discrete optimization ⋮ Faster approximation for maximum independent set on unit disk graph ⋮ A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM ⋮ Maximizing single attribute diversity in group selection ⋮ Away from each other ⋮ Obtaining approximately optimal and diverse solutions via dispersion ⋮ Unnamed Item ⋮ Algorithms for \(k\)-dispersion for points in convex position in the plane ⋮ Theory and application of width bounded geometric separators ⋮ Maximum independent set and maximum clique algorithms for overlap graphs ⋮ Dispersing points on intervals ⋮ Parameterized study of Steiner tree on unit disk graphs ⋮ Dispersing and grouping points on planar segments ⋮ On the intersection graph of the disks with diameters the sides of a convex \(n\)-gon ⋮ Hierarchically specified unit disk graphs ⋮ Unnamed Item ⋮ Facility location with tree topology and radial distance constraints ⋮ Max-min dispersion on a line ⋮ Integer-friendly formulations for the \(r\)-separation problem ⋮ Hierarchically specified unit disk graphs ⋮ Minimizing Co-location Potential of Moving Entities ⋮ Finding, hitting and packing cycles in subexponential time on unit disk graphs ⋮ On the complexity of two circle connecting problems
Cites Work
This page was built for publication: A study on two geometric location problems
