Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An optimal approximation algorithm for the rectilinear m-center problem

From MaRDI portal
Publication:911284
Jump to:navigation, search

DOI10.1007/BF01840393zbMath0696.68063MaRDI QIDQ911284

N. E. Zubov

Publication date: 1990

Published in: Algorithmica (Search for Journal in Brave)


zbMATH Keywords

approximation algorithmNP-completenessrectilinear m-center problem


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)


Related Items (4)

Bounded fan-out \(m\)-center problem ⋮ A simple linear algorithm for computing rectilinear 3-centers ⋮ Parametric search: three new applications ⋮ One-way and round-trip center location problems



Cites Work

  • On the Complexity of Some Common Geometric Location Problems
  • Single Facility $l_p $-Distance Minimax Location
  • On the rectangularp-center problem
  • Unnamed Item


This page was built for publication: An optimal approximation algorithm for the rectilinear m-center problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:911284&oldid=12874154"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 17:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki