New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem

descriptionPublicationkeyboard_double_arrow_right Article , Part of book or chapter of book , Conference object 01 Jan 2012 English Publisher:Springer Science and Business Media LLCJournal:Algorithmica, volume 75, pages 53-83 (issn: 0178-4617, eissn: 1432-0541,

Copyright policy )Funded by:NSERC | unidentified

Authors: Babak Behsaz; Mohammad R. Salavatipour; Zoya Svitkina;

doi: 10.1007/s00453-015-0012-z , 10.1007/978-3-642-31155-0_21

New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem

- Summary
- Subjects
- Related research
  (1)
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

University of Alberta
Canada
Google (United States)
United States

Keywords

Discrete location and assignment, hard capacities, approximation algorithms, Approximation algorithms, capacitated facility location

1 Research products, page 1 of 1

Prize-Collecting Steiner Tree and Forest in Planar Graphs
2010IsAmongTopNSimilarDocuments

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	9
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average