A study on two geometric location problems
From MaRDI portal
Publication:1122367
DOI10.1016/0020-0190(88)90174-3zbMath0675.68071MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68U99: Computing methodologies and applications
52A37: Other problems of combinatorial convexity
68R99: Discrete mathematics in relation to computer science
Related Items
Integer-friendly formulations for the \(r\)-separation problem, Hierarchically specified unit disk graphs, On the complexity of two circle connecting problems, A comparison of \(p\)-dispersion heuristics