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

Exact algorithms for the max-min dispersion problem

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

DOI10.1007/978-3-319-78455-7_20zbMath1446.68189OpenAlexW2790867603MaRDI QIDQ777304

Kunihiro Wasa, Ryuhei Uehara, Tetsuya Araki, Takashi Horiyama, Toshiki Saitoh, Takeaki Uno, Yoshio Okamoto, Toshihiro Akagi, Yota Otachi, Shin-ichi Nakano

Publication date: 7 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-319-78455-7_20


zbMATH Keywords

dispersion problemexact algorithm


Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27)


Related Items

Away from each other ⋮ Algorithms for \(k\)-dispersion for points in convex position in the plane ⋮ Max-min dispersion on a line ⋮ Repulsion-based p-dispersion with distance constraints in non-convex polygons ⋮ Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon




This page was built for publication: Exact algorithms for the max-min dispersion problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:777304&oldid=12708271"
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 12:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki