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

A bicriteria approximation algorithm for the \(k\)-center and \(k\)-median problems

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

DOI10.1007/978-3-319-89441-6_6zbMath1442.68261OpenAlexW2794718956MaRDI QIDQ1644926

Soroush Alamdari, David B. Shmoys

Publication date: 22 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-89441-6_6



Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)


Related Items (2)

The distance-constrained matroid median problem ⋮ Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time







This page was built for publication: A bicriteria approximation algorithm for the \(k\)-center and \(k\)-median problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1644926&oldid=13952036"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 04:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki