Easy and hard bottleneck location problems
type: Item
instance of: scholarly article
title: Easy and hard bottleneck location problems
zbMATH Open document ID: 0424.90049
DOI: 10.1016/0166-218X(79)90044-1
author: S. H. Smith
published in: Discrete Applied Mathematics
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 3661099
zbMATH Keywords: bottleneck location problem on a graph
zbMATH Keywords: blocking clutters
zbMATH Keywords: duality
zbMATH Keywords: disconnecting sets on a graph
zbMATH Keywords: binary search
zbMATH Keywords: dynamic programming
zbMATH Keywords: polynomial time algorithm
zbMATH Keywords: NP-hard problem
zbMATH Keywords: NP-complete problem
MaRDI profile type: Publication
cites work: Q4773298
cites work: Q4083324
cites work: Bottleneck extrema
cites work: Q4198056
cites work: Scheduling to Minimize Interaction Cost
cites work: P-Complete Approximation Problems
full work available at URL: 0166-218x(79)90044-1
OpenAlex ID: W1983197449
description: scientific article; zbMATH DE number 3661099