×

zbMATH — the first resource for mathematics

Easy and hard bottleneck location problems. (English) Zbl 0424.90049

MSC:
90C10 Integer programming
68Q25 Analysis of algorithms and problem complexity
05C35 Extremal problems in graph theory
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Aho, A.V.; Hopcroft, J.E.; Ullman, J.D., The design and analysis of computer algorithms, (1974), Addison-Wesley Reading, MA · Zbl 0286.68029
[2] Christofides, N., Graph theory: an algorithmic approach, (1975), Academic Press New York · Zbl 0321.94011
[3] Church, R.L.; Garfinkel, R.S., Locating an obnoxious facility on a network, Transportation sci., 12, 107-118, (1978)
[4] Edmonds, J.; Fulkerson, D.R., Bottleneck extrema, J. combinatorial theory, 8, 299-306, (1970) · Zbl 0218.05006
[5] Garey, M.R.; Johnson, D.S., Computers and intractability: A guide to the theory of NP-completeness, (1979), W.H. Freeman San Francisco · Zbl 0411.68039
[6] Hu, T.C., The maximum capacity route problem, Operations res., 9, 898-900, (1961)
[7] Nemhauser, G.L., Introduction to dynamic programming, (1966), Wiley New York · Zbl 0139.13202
[8] Sahni, S.; Gonzalez, T., P-complete approximation problems, J. assoc. comput. Mach., 23, 555-565, (1976) · Zbl 0348.90152
[9] Shier, D.R., A MIN-MAX theooem for p-center problems on a tree, Transportation sci., 11, 243-252, (1977)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.