An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints

Discrete Applied Mathematics

Volumn 154, Issue 9, 2006, Pages 1344-1357

  Bruglieri, Maurizio ^a   Ehrgott, Matthias ^b   Hamacher, Horst W ^c   Maffioli, Francesco ^a  

^a POLITECNICO DI MILANO   (Italy)

^b UNIVERSITY OF AUCKLAND   (New Zealand)

^c Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

Annotated bibliography; Cardinality constraint; Combinatorial optimization

Indexed keywords

CONSTRAINT THEORY; INTEGRATED CIRCUIT LAYOUT; OPTIMIZATION; PLANNING; PROBLEM SOLVING; SET THEORY; TELECOMMUNICATION SYSTEMS;

ANNOTATED BIBLIOGRAPHY; CARDINALITY CONSTRAINT; COMBINATORIAL OPTIMIZATION;

COMBINATORIAL MATHEMATICS;

EID: 33646053771     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.05.036     Document Type: Article

References (131)

1. Ageev A.A., and Sviridenko M.I. Approximation algorithms for maximum coverage and max cut with given sizes of parts. In: Cornuejols G., Burkard R.E., and Woeginger G.J. (Eds). Integer Programming and Combinatorial Optimization, Seventh International IPCO Conference, June 9-11, 1999, Graz, Austria, Proceedings, Lecture Notes in Computer Science vol. 1610 (1999), Springer, Berlin 17-30
2. Aggarwal A., Imai H., Katoh N., and Suri S. Finding k points with minimum diameter and related problems. J. Algorithms 12 (1991) 38-56
3. Aghezzaf E.H., and Wolsey L.A. Lot-sizing polyhedra with a cardinality constraint. Oper. Res. Lett. 11 (1992) 13-18
4. Ahuja R.K., and Magnanti T.L. Network Flows: Theory, Algorithms and Applications (1993), Prentice-Hall, Englewood Cliffs, NJ
5. Alon N., Yuster R., and Zwick U. Color-coding. J. Assoc. Comput. Mach. 42 4 (1995) 844-856
6. Arora S. Polynomial time approximation algorithms for Euclidean TSP and other geometric problems. J. Assoc. Comput. Mach. 45 5 (1998) 1-30 Preliminary version in: Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, IEEE Society Press, Piscataway NJ, 1998, pp. 2-11
7. Arora S. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. In: Pardalos P.M., and Du D. (Eds). Network Design and Facilities Location, DIMACS Series in Discrete Mathematics vol. 40 (1998), American Mathematical Society, Providence, RI 1-2
8. Arora S., and Karakostas G. A 2 + ε{lunate} approximation algorithm for the k-MST problem. Proceedings of the SIAM Symposium on Discrete Algorithm, (SODA) 2000 (2000), SIAM, Philadelphia 402-408
9. Arya S., and Ramesh H. A 2.5-factor approximation algorithm for the k-MST problem. Inform. Process. Lett. 65 (1998) 117-118
10. Asahiro Y., and Iwama K. Finding dense subgraphs. In: Staples J., Endes P., Katoh N., and Moffat A. (Eds). Algorithms and Computation Sixth International Symposium, ISAAC95, December 4-6, 1995, Cairns, Australia, Proceedings, Lecture Notes in Computer Science vol. 1004 (1995), Springer, Berlin 102-111
11. Asahiro Y., Iwama K., Tamaki H., and Tokuyama T. Greedily finding a dense subgraph. In: Karlsson R., and Lingas A. (Eds). Algorithm Theory SWAT' 96, Proceedings of the Fifth Scandinavian Workshop on Algorithm Theory, July 1996, Reykjavik, Iceland, Lecture Notes in Computer Science vol. 1097 (1996), Springer, Berlin 136-148
12. Awerbuch B., Azar Y., Blum A., and Vempala S. Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. Proceedings of the 27th Annual ACM Symposium on Theory of Computing (1995), ACM Press, New York 277-283
13. Awerbuch B., Azar Y., and Vempala S. New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. SIAM J. Comput. 28 1 (1998) 254-262
14. Babel L., Chen B., Kellerer H., and Kotov V. On-line algorithms for cardinality constrained bin-packing problems. In: Eades P., and Takaoka T. (Eds). Algorithms and Computation, Proceedings of the 12th International Symposium, ISAAC 2001, December 19-21, 2001, Christchurch, New Zealand, Lecture Notes in Computer Science vol. 2223 (2001), Springer, Berlin 695-706
15. Babel L., Kellerer H., and Kotov V. The k-partitioning problem. Math. Methods of Oper. Res. 47 (1998) 59-82
16. Bezrukov S.L., Elsässer R., and Schroeder U.-P. On k-partitioning of Hamming graphs. Discrete Appl. Math. 95 (1999) 127-140
17. Bezrukov S.L., Elsässer R., and Schroeder U.-P. On bounds for the k-partitioning of graphs. In: Asano T., Imai H., Lee D.T., Nakano S., and Tokuyama T. (Eds). Computing and Computing and Combinatorics, Proceedings of the Fifth Annual International Conference, COCOON' 99 July 26-28, Tokyo, Japan, 1999, Lecture Notes in Computer Science vol. 1627 (1999), Springer, Berlin, Heidelberg 154-163
18. Blesa M.J., Moscato P., and Xhafa F. A memetic algorithm for the minimum weighted k-cardinality tree subgraph problem. In: Sousa J.P., and Resende M.G. (Eds). Proceedings of the Metheuristics International Conference MIC 2001, July 2001, Porto, Portugal (2001), Kluwer, Dordrecht 85-90
19. M.J. Blesa, F. Xhafa, A C ++ implementation of tabu search for k-cardinality tree problem, Presented at Second International Symposium on Generative and Component-based Software Engineering, Erfurt, Germany, October 2000.
20. M.J. Blesa, F. Xhafa, The minimum weighted k-cardinality tree problem, http://www.lsi.upc.es/ ∼mjblesa/TSExperiments/minktree.html, 2000.
21. C. Blum, Optimality criteria and local search methods for node-weighted k-cardinality tree and subgraph problems, Master's Thesis, Universität Kaiserslautern, Fachbereich Mathematik, 1998 (in German).
22. C. Blum, M. Blesa, New metaheuristic approaches for the edge-weighted k-cardinality tree problem, Comput. Oper. Res. 32 (2005) 1355-1377.
23. Blum A., Chalasani P., and Vempala A. A constant-factor approximation for the k-MST problem in the plane. Proceedings of the 27th Annual ACM Symposium on Theory of Computing (1995), ACM Press, New York 294-302
24. Blum C., and Ehrgott M. Local search algorithms for the k-cardinality tree problem. Discrete Appl. Math. 128 2-3 (2002) 511-540
25. Blum A., Ravi R., and Vempala S. A constant-factor approximation for the k-MST problem. J. Comput. System Sci. 58 (1999) 101-108
26. Bodlaender H.L. On linear time minor tests with depth-first search. J. Algorithms 14 (1993) 1-23
27. R. Borndörfer, C. Ferreira, A. Martin, Matrix decomposition by branch-and-cut, Technical Report SC-97-14, Konrad-Zuse-Zentrum für Informatiosntechnik, Berlin, 1997.
28. Borndörfer R., Ferreira C., and Martin A. Decomposing matrices into blocks. SIAM J. Optim. 9 1 (1998) 236-269
29. J. Bramel, L. Chan, D. Simchi-Levi, Worst-case analysis of the modified LPT heuristic for the two-machine makespan problem with capacity constraints, Discrete Appl. Math., submitted.
30. M. Bruglieri, K-cardinality cut problems, Ph.D. Thesis, Università di Milano, Dipartimento di Mathematica "F. Enriques", 2001.
31. Bruglieri M., Ehrgott M., and Maffioli F. Cardinality constrained minimum cut problems: complexity and algorithms. Discrete Appl. Math. 137 (2004) 311-341
32. Bui T.N., and Moon B.R. Genetic algorithm and graph partitioning. IEEE Trans. Comput. 45 7 (1996) 841-855
33. Burkard R.E., and Rendl F. Lexicographic bottleneck problems. Oper. Res. Lett. 10 (1991) 303-308
34. Cao B. Search-hide games on trees. European J. Oper. Res. 80 (1995) 175-183
35. Caprara A., Kellerer H., Pferschy U., and Pisinger D. Approximation algorithms for knapsack problems with cardinality constraints. European J. Oper. Res. 123 (2000) 333-345
36. F. Catanas, Heuristics for the p-minimal spanning tree problem, Technical report, Centre for Quantitative Finance, Imperial College, London, 1997.
37. B. Chandra, M.M. Halldórsson, Approximation algorithms for dispersion problems, J. Algorithms 38 (2001) 438-465.
38. Cheriyan J., and Thurimella R. Fast algorithms for k-shredders and k-node connectivity augmentation. J. Algorithms 33 (1999) 15-50
39. Cheung S., and Kumar A. Efficient quorumcast routing algorithms. Proceedings of the IEEE Conference on Computer Communications INFOCOM' 94 (1994), IEEE Society Press, Piscataway NJ 840-847
40. Christofides N., and Brooker P. The optimal partitioning of graphs. SIAM J. Appl. Math. 30 1 (1976) 55-69
41. Coffman Jr. E.G., and Galambos G. Bin packing approximation algorithms: combinatorial analysis. In: Du D.-Z., and Pardalos P.M. (Eds). Handbook of Combinatorial Optimization (1998), Kluwer, Dordrecht 1-47 (Section 5.5)
42. Current J., Daskin M., and Schilling D. Discrete network location models. In: Drezner Z., and Hamacher H.W. (Eds). Facility Location-Applications and Theory (2002), Springer, Berlin, Heidelberg, New York 81-118
43. Dahl G., and Realfsen B. The cardinality-constrained shortest path problem in 2-graphs. Networks 36 1 (2000) 1-8
44. max problem, J. Heuristics. 10 (2004) 169-204.
45. Dell'Amico M., and Martello S. The k-cardinality assignment problem. Discrete Appl. Math. 76 (1997) 103-121
46. max problem. J. Scheduling 4 (2001) 123-138
47. Dell'Amico M., Lodi A., and Martello S. Efficient algorithms and codes for k-cardinality assignment problem. Discrete Appl. Math. 110 (2001) 25-40
48. P. Dell'Olmo, P. Hansen, S. Pallottino, G. Storchi, On uniform k-partition problems, Les Cahier du GERAD, G-2001-58, Discrete Appl. Math., submitted 150 (2005) 121-139.
49. S. Ding, N. Ishii, A genetic algorithm approach on k-subtree problem, Technical Report, Department of Intelligence and Computer Science, Nagoya Institute of Technology, 2000.
50. Dobkin D.P., Drysdale R.L., and Guibas L.J. Finding smallest polygons. Adv. Comput. Res. 1 (1983) 181-214
51. Donath W.E., and Hoffman A.J. Lower bounds for the partitioning of graphs. IBM J. Res. Develop. 17 (1973) 420-425
52. Downey R., and Fellows M. Parameterized Complexity (1999), Springer, Berlin, Heidelberg, New York
53. Dudas T., Klinz B., and Woeginger G. The computational complexity of the k-minimum spanning tree problem in graded matrices. Comput. Math. Appl. 36 (1998) 61-67
54. M. Ehrgott, Optimization problems in graphs under cardinality restrictions, Master's Thesis, Universität Kaiserslautern, Fachbereich Mathematik, 1992.
55. Ehrgott M. k-cardinality subgraphs. Operations Research Proceedings 1994 (1994), Springer, Berlin 86-91
56. Ehrgott M., and Freitag J. K_TREE/K_SUBGRAPH: A program package for minimal weighted K-cardinality-trees and -subgraphs. European J. Oper. Res. 93 1 (1996) 224-225. http://optimierung.mathematik.uni-kl.de/project/index.html http://optimierung.mathematik.uni-kl.de/project/index.html
57. Ehrgott M., Freitag J., Hamacher H.W., and Maffioli F. Heuristics for the k-cardinality tree and subgraph problem. Asia Pacific J. Oper. Res. 14 1 (1997) 87-114
58. D. Eppstein, New algorithms for minimum area k-gons, Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, Orlando, Florida, United States, 1992, pp. 83-88.
59. Eppstein D. Faster geometric k-point MST approximation. Comput. Geometry 8 5 (1997) 231-240
60. Faigle U., and Kern W. Computational complexity of some maximum average weight problems with precedence constraints. Oper. Res. 42 4 (1994) 688-693
61. Feige U., Kortsarz G., and Peleg D. The dense k-subgraph problem. Algorithmica 29 3 (2001) 410-421
62. Feige U., and Langberg M. Approximation algorithms for maximization problems arising in graph partitioning. J. Algorithms 41 (2001) 174-211
63. U. Feige, M. Seltser, On the densest k-subgraph problem, Technical Report, Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot, Israel, 1997.
64. W. Fernandez de la Vega, M. Karpinski, C. Kenyon, Approximation schemes for metric minimum bisection and partitioning, in: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA), 2004, 506-515.
65. Fischetti M., Hamacher H.W., Joernsten K., and Maffioli F. Weighted k-cardinality trees: complexity and polyhedral structure. Networks 24 (1994) 11-21
66. L. Foulds, H.W. Hamacher, A new integer programming approach to (restricted) facilities layout problems allowing flexible facility shapes, Technical Report 1992-3, Department of Management Science, University of Waikato, 1992.
67. Foulds L., Hamacher H.W., and Wilson J. Integer programming approaches to facilities layout models with forbidden areas. Ann. Oper. Res. 81 (1998) 405-417
68. J. Freitag, Minimal k-cardinality trees, Master's Thesis, Universität Kaiserslautern, Fachbereich Mathematik, 1993 (in German).
69. Frieze A., and Jerrum M. Improved approximation algorithms for max k-cut and max bisection. Algorithmica 18 (1997) 67-81
70. R. Fulkerson, I. Glicksberg, O. Gross, A production line assignment problem, Technical Report RM-1102, The Rand Corporation, Sta. Monica, CA, 1953.
71. Gamble A.B., and Pulleyblank W.R. Forest cover and polyhedral intersection theorems. Math. Programming 45 (1989) 45-58
72. Garey M., and Johnson D. Computers and Intractability-A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco, CA
73. Garfinkel R. An improved algorithm for bottleneck assignment problems. Oper. Res. 19 (1971) 1747-1751
74. Garg N. A 3-approximation for the minimum tree spanning k vertices. Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (1996), IEEE Society Press, Los Alamitos 302-309
75. Garg N., and Hochbaum D. An O ( log k ) approximation algorithm for the k minimum spanning tree problem in the plane. Algorithmica 18 (1997) 111-121
76. Goemans M.X., and Williamson D.P. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach. 42 (1995) 1115-1145
77. Goldschmidt O., and Hochbaum D. k-edge subgraph problems. Discrete Appl. Math. 74 (1997) 159-169
78. Goldschmidt O., Hochbaum D., Hurkens C., and Yu G. Approximation algorithms for the k-clique covering problem. SIAM J. Discrete Math. 9 3 (1996) 492-509
79. Guttmann-Beck N., and Hassin R. Approximation algorithms for minimum k-cut. Algorithmica 27 2 (2000) 198-207
80. Halldórsson M., Iwano K., Katoh N., and Tokuyama T. Finding subsets maximizing minimum structures. In: Clarkson K. (Ed). Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (1995), SIAM, Philadelphia, ACM, New York 150-159
81. A. Hamacher, Numerical treatment of the travelling salesman selection problem, Master's Thesis, Mathematisches Institut, Universität zu Köln, 1993 (in German).
82. H.W. Hamacher, K. Joernsten, Optimal relinquishment according to the Norwegian petrol law: a combinatorial optimization approach, Technical Report no. 7/93, Norwegian School of Economics and Business Administration, Bergen, 1993.
83. H.W. Hamacher, K. Joernsten, F. Maffioli, Weighted k-cardinality trees, Technical Report 91.023, Politecnico di Milano, Dipartimento di Elettronica, 1991.
84. Hamacher A., and Moll C. The Euclidean traveling salesman selection problem. In: Zimmermann U., Derigs U., Gaul W., Möhring R.H., and Schuster K.P. (Eds). Operations Research Proceedings 1995 (1996), Springer, Berlin 54-59
85. Hamacher H.W., and Schöbel A. On center cycles in grid graphs. Ann. Oper. Res. 122 (2003) 163-175
86. Holyer J. The NP-completeness of some edge-partition problems. SIAM J. Comput. 10 (1981) 713-717
87. Jian L., and Xing min W. A kind of efficient algorithm on the optimal k-partitioning of the graphs. J. Huazhong Univ. Sci. Tech. 6 1 (1984) 1-12
88. Joernsten K., and Lokketangen A. Tabu search for weighted k-cardinality trees. Asia Pacific J. Oper. Res. 14 2 (1997) 9-26
89. Karisch S.E., and Rendl F. Semidefinite programming and graph equipartition. In: Pardalos P.M., and Wolkowicz H. (Eds). Topics in Semidefinite and Interior-Point Methods, Fields Institute Communications vol. 18 (1998), American Mathematical Society, Providence, RI 77-95
90. S. Kataoka, N. Araki, Lagrangian relaxation approach to the minimum rooted k-subtree problem, Technical Report, Department of Computer Science, The National Defense Academy, Yokosuka, Japan, 2000.
91. Kataoka S., Araki N., and Yamada T. Upper and lower bounding procedures for minimum rooted k-subtree problem. European J. Oper. Res. 122 3 (2000) 561-569
92. Kellerer H., and Pferschy U. Cardinality constrained bin-packing problems. Ann. Oper. Res. 92 (1999) 335-348
93. Kernighan B.W., and Lin S. An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49 (1970) 291-307
94. Kortsarz G., and Peleg D. On choosing dense subgraphs. Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science (1993), IEEE Society Press, Piscataway, NJ 692-701
95. Krause K.L., Shen V.Y., and Schwetman H.D. Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. J. ACM 22 (1975) 522-550
96. Krause K.L., Shen V.Y., and Schwetman H.D. Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems, Errata. J. ACM 24 (1977) 527
97. Krumke S., Marathe M., Noltemeier H., Radhakrishnan V., Ravi S., and Rosenkrantz D. Compact location problems. Theoret. Comput. Sci. 181 (1997) 379-404
98. Labbé M. Location problems. In: Dell'Amico M., Maffioli F., and Martello S. (Eds). Annotated Bibliographies in Combinatorial Optimization (1997), Wiley, Chichester 261-281
99. Labbé M. Facility location: models, methods and applications. In: Labbé M., Laporte G., Tanczos K., and Toint P. (Eds). Operations Research and Decision Aid Methodologies in Traffic and Transportation Management, Proceedings of the NATO ASI, March 10-21, 1997, Balatonfüred, Hungary (1998), Springer, Berlin 264-285
100. Labbé M., Peeters D., and Thisse J. Location on networks. In: Ball M.O., Magnanti T.L., Monma C.L., and Nemhauser G.L. (Eds). Network Routing, Handbooks in OR & MS vol. 8 (1995), Elsevier, Amsterdam 551-624
101. E. Lawler, J. Lenstra, A. Rinooy Kan, D. Shmooys (Eds.), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley Interscience Series in Pure and Applied Mathematics, Wiley, Chichester, 1985.
102. Leighton T., and Rao S. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. Assoc. Comput. Mach. 46 6 (1999) 787-832
103. Lengauer T. Combinatorial Algorithms for Integrated Circuit Layout (1990), Wiley, Chichester
104. F. Maffioli, Finding a best subtree of a tree, Technical Report 91.041, Politecnico di Milano, Dipartimento di Elettronica e Informazione, 1991.
105. Marathe M., Ravi D., Ravi S.S., Rosenkrantz D., and Sundaram R. Spanning trees-short or small. SIAM J. Discrete Math. 9 2 (1996) 178-200
106. M. Mastrolilli, M. Hutter, Hybrid rounding techniques for knapsack problems, Discrete Appl. Math., in press.
107. Mata C., and Mitchell J. Approximation algorithms for geometric tour and network problems. Proceedings of the 11th Annual Symposium on Computational Geometry (1995), ACM, New York 360-369
108. Minoux M. Une characterisation des couplages de poids maximal et de cardinalité fixée dans les graphes pondérés finis. Comptes rendues des sessions de la Academie des Sciences Paris, Serie, A 282 (1976) 353-354
109. Mitchell J. Guillotine subdivisions approximate polygonal subdivisions: a simple new method for the geometric k-MST problem. Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (1996), SIAM, Philadelphia, ACM, New York 402-408
110. Mitchell J. Guillotine subdivisions approximate polygonal subdivisions: a simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM J. Comput. 28 4 (1999) 1298-1309
111. Mitchell J., Blum A., Chalasani P., and Vempala S. A constant-factor approximation algorithm for the geometric k-MST problem in the plane. SIAM J. Comput. 28 3 (1998) 771-781
112. Nehme D., and Yu G. The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications. Discrete Appl. Math. 74 (1997) 57-68
113. A. Philpott, N. Wormald, On the optimal extraction of ore from an open-cast mine, Technical Report, Department of Engineering Science, The University of Auckland, 1997.
114. S. Rajagopalan, V. Vazirani, Logarithmic approximation of minimum weight k trees, 1995, Unpublished manuscript.
115. Ravi S., Rosenkrantz D., and Tayi G. Facility dispersion problems: heuristics and special cases. In: Dehne F., Sack J.R., and Santoro N. (Eds). Algorithms and Data Structures, second Workshop WADS91, August 14-16, 1991, Lecture Notes in Computer Science vol. 519 (1991), Springer, Berlin, Ottawa, Canada 355-366
116. Ravi S., Rosenkrantz D., and Tayi G. Heuristic and special case algorithms for dispersion problems. Oper. Res. 42 (1994) 299-310
117. Rendl F., and Wolkowicz H. A projection technique for partitioning the nodes of a graph. Ann. Oper. Res. 58 (1995) 155-179
118. Robertson N., and Seymour P. Graph minors IV, tree-width and well-quasi-ordering. J. Combin. Theory Ser. B 48 (1990) 227-254
119. Saran H., and Vazirani V. Finding k-cuts within twice the optimal. In: Saran H. (Ed). Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (1991), IEEE Press, Piscataway NJ 743-751
120. Späth H. The facility selection-location problem. OR Spektrum 6 (1984) 141-146
121. Späth H. Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs. Z. Oper. Res. 29 (1985) 125-131
122. Tsai L.H. Asymptotic analysis of an algorithm for balanced parallel processor scheduling. SIAM J. Comput. 21 (1992) 59-94
123. Urosevic D., Brimberg J., and Mladenovic N. Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem. Comput. Operat. Res. 31 (2004) 1205-1213
124. J.E. Ward, R.T. Wong, P. Lemke, A. Outjit, Properties of the tree K-median linear programming relaxation, Research Report CC-878-29, Institute for Interdisciplinary Engineering Studies, Purdue University, 1987.
125. White L.J. Minimum covers of fixed cardinality in weighted graphs. SIAM J. Appl. Math. 21 1 (1971) 104-113
126. White D. The maximal dispersion problem and the "first point outside the neighbourhood" heuristic. Comput. Oper. Res. 18 1 (1991) 43-50
127. White L.J., and Gillerson M.L. An efficient algorithm for minimum k-covers of in weighted graphs. Math. Programming 8 (1975) 20-42
128. Woeginger G. Computing maximum valued regions. Acta Cybernet. 10 4 (1992) 303-315
129. Yamaguchi T., Foulds L., and Lamb J. Central cycles in graphs. Mem. Muroran Inst. Tech. 48 (1998) 93-99
130. H. Yang, Y. Ye, J. Zhang, An approximation algorithm for the two-parallel machines scheduling problem with capacity constraints, Working Paper, Department of Management Sciences, The University of Iowa, 2000.
131. A. Zelikovsky, D. Lozevanu, Minimal and bounded trees, in: Tezele Congresului XVIII al Academiei Romano-Americane, Kishinev, 1993., pp. 25-26.