Minimal spanning trees with a constraint on the number of leaves-Reference-Cited by-同舟云学术

Minimal spanning trees with a constraint on the number of leaves

Published:1998-01 Issue:1 Volume:104 Page:250-261
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Fernandes Lucinda Matos,Gouveia Luis

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference14 articles.

1. Optimum branchings in mathematics of the decision sciences;Edmonds,1968

2. O problema da árvore de suporte de custo mínimo com uma restrição adicional no número de folhas;Fernandes,1994

3. An efficient algorithm for the min-sum arborescence problem on complete digraphs;Fischetti;ORSA Journal on Computing,1993

4. A short note on the approximability of the maximum leaves spanning tree problem;Galbiati;Information Processing Letters,1994

5. Computers and Intractability;Garey,1979

Cited by 37 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Radius, leaf number, connected domination number and minimum degree;Quaestiones Mathematicae;2022-04-12

2. Connectivity, Traceability and Hamiltonicity;La Matematica;2022-01-10

3. A personalized walking bus service requiring optimized route decisions: A real case;European Journal of Operational Research;2021-03

4. Solving Steiner trees: Recent advances, challenges, and perspectives;Networks;2020-11-27

5. Bounds on the leaf number in graphs of girth 4 or 5;Journal of Discrete Mathematical Sciences and Cryptography;2020-06-24