Keywords
- Minimum Span Tree
- Travel Salesman Problem
- Decomposition Tree
- Multiplication Table
- Optimal Assignment
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
E. L. Lawler and C. U. Martel, "Flow Network Formulations of Polymatroid Optimization Problems," Annals Discrete Math., 16 (1982) 189–200.
M. W. Bern, E. L. Lawler and A. L. Wong, "Why Certain Subgraph Computations Require Only Linear Time," Proc. 26th Annual IEEE Symposium on Foundations of Computer Science, October 1985.
P. C. Gilmore, E. L. Lawler and D. B. Shmoys, "Well-Solved Special Cases," chapter in The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys (eds.), J. Wiley, 1985.
References
J. Edmonds and D. R. Fulkerson, "Transversals and Matroid Partition", J. Res. Nat. Bur. Standards, B69 (1965) 147–153.
J. Edmonds and R. Giles, "A Min-Max Relation for Submodular Functions on Graphs", Ann. Discrete Math., 1 (1977) 185–204.
S. Fujishige, "Algorithms for Solving the Independent Flow Problems", J. Oper. Ress. Soc. Japan, 21 (1978) 189–204.
M. Iri and N. Tomizawa, "An Algorithm for Finding an Optimal Independent Assignment", J. Oper. Res. Soc. Japan, 19 (1976) 32–57.
E. L. Lawler and C. U. Martel, "Computing Maximal ‘Polymatroidal’ Network Flows", Math. Oper. Res., 7 (1982) 334–347.
L. Loväsz, "The Matroid Matching Problem", in: Algebraic Methods in Graph Theory, Colloq. Math. Soc. János Bolyai, 25 (1978) 495–517.
R. Rado, "A Theorem on Independence Relations", Quart. J. Math., (Oxford) 13 (1942) 83–89.
References
T. Beyer, A. Proskurowski, S. Hedetniemi, and S. Mitchell, "Independent Domination in Trees," Proc. 8th S. E. Conf. on Combinatorics, Graph Theory, and Computing, Utilitas Mathematica, Winnipeg, 1977, 321–328.
B. Bollo0000123as and E. J. Cockayne, "Graph Theoretic Parameters Concerning Domination, Independence, and Irredundance," J. Graph Theory, 3 (1979), 241–250.
B. Bollo0000124as and E. J. Cockayne, "The Irredundance Number and Maximum Degree of a Graph," Discrete Math., 49 (1984), 197–199.
E. J. Cockayne, O. Favaron, C. Payan, and A. Thomason, "Contributions to the Theory of Domination, Independence, and Irredundance in Graphs," Discrete Math., 33 (1981), 249–258.
E. J. Cockayne, S. E. Goodman, and S. T. Hedetniemi, "A Linear Algorithm for the Domination Number of a Tree," Infor. Processing Lett., 4 (1975), 41–44.
G. Cornúejols, D. Naddef, and W. R. Pulleyblank, "Halin Graphs and the Traveling Salesman Problem," Math. Programming, 26 (1983), 287–294.
A. M. Farley and A. Proskurowski, "Computing the Maximum Order of an Open Irredundant Set in a Tree," manuscript, 1983.
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., 1979.
S. M. Hedetniemi, S. T. Hedetniemi, and R. Laskar, "Domination in Trees: Models and Algorithms," Proc. 5th International Conference on Graph Theory, Kalamazoo, 1984.
T. Kikuno, N. Yoshida, and Y. Kakuda, "A Linear Algorithm for the Domination Number of a Series-Parallel Graphs," Discrete Appl. Math., 5 (1983) 299–311.
R. Laskar, J. Pfaff, S. M. Hedetniemi, and S. T. Hedetniemi, "On the Algorithmic Complexity of Total Domination," SIAM J. Alg. Disc. Methods, 5 (1984), 420–425.
D. Monien and I. H. Sudborough, "Bandwidth Constrained NP-Complete Problems," Proc. 13th Ann. Symposium on the Theory of Computing, 1981, 207–217.
J. Pfaff, Ph.D. thesis, Clemson University.
H. D. Ratliff and A. S. Rosenthal, "Order Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem," Operations Res., 31 (1983), 507–521.
K. Takamizawa, T. Nishizeki, and N. Saito, "Linear-Time Computability of Combinatorial Problems on Series-Parallel Graphs," JACM, 29 (1982), 623–641.
J.A. Wald and C.J. Colburn, "Steiner Trees in Outerplanar Graphs," Proc. 13th Southeastern Conf. Combinatorics, Graph Theory and Computing, 1982, 15–22.
J.A. Wald and C.J. Colburn, "Steiner Trees, Partial 2-Trees, and Minimum IFI Networks," Networks, 13 (1983), 159–167.
P. Winter, unpublished manuscript, 1985.
References
Samuel H. Fuller, "An Optimal Drum Scheduling Algorithm," IEEE Trans. Computers, C-21 (1972) 1153–1165.
R.S. Garfinkel, Minimizing Wallpaper Waste, part I: a class of traveling salesman problems. Oper. Res. 25 (1977) 741–751.
Eugene L. Lawler, "A Solvable Case of the Travelling Salesman Problem," Math. Programming 1 (1971) 267–269.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag
About this paper
Cite this paper
Lawler, E.L. (1989). Combinatorial structures and combinatorial optimization. In: Simeone, B. (eds) Combinatorial Optimization. Lecture Notes in Mathematics, vol 1403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0083464
Download citation
DOI: https://doi.org/10.1007/BFb0083464
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51797-9
Online ISBN: 978-3-540-46810-3
eBook Packages: Springer Book Archive
