Scatter search for the minimum leaf spanning tree problem

DOI10.1016/J.COR.2022.105858MaRDI QIDQ2147145zbMATH OpenOpenAlexWikidataFDO

Authors Yogita Singh Kardam, Kamal Srivastava, Pallavi Jain, Rafael Martí

Publication date 22 June 2022

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2022.105858

zbMATH Keywords

metaheuristicsscatter searchspanning tree

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Publication:4949834
• A randomized linear-time algorithm to find minimum spanning trees
• Heuristic search for the generalized minimum spanning tree problem
• An approximation algorithm for the maximum leaf spanning arborescence problem
• A generalization of the minimum branch vertices spanning tree problem
• An optimal minimum spanning tree algorithm
• Publication:2754133
• Minimum spanning hypertrees
• A randomized linear-time algorithm for finding minimum spanning trees (extended abstract)

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs
• A \(\frac{4}{3}\)-approximation algorithm for the maximum internal spanning tree problem
• A survey on algorithms for the maximum internal spanning tree and related problems
• Algorithms and Data Structures
• Approximating the maximum internal spanning tree problem
• Approximation Algorithms for the Maximum Internal Spanning Tree Problem
• Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs
• Better approximation algorithms for the maximum internal spanning tree problem
• Complexities of some interesting problems on spanning trees
• Complexity of independency and cliquy trees
• Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
• Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
• Lower and upper bounds for the spanning tree with minimum branch vertices
• Minimal congestion trees
• Multi-objective optimization using evolutionary algorithms
• On finding spanning trees with few leaves
• On the minimum leaf number of cubic graphs
• Relations, models and a memetic approach for three degree-dependent spanning tree problems
• Scatter Search and Path Relinking: Advances and Applications
• Scatter search for the bandpass problem
• Scatter search with path relinking for the job shop with time lags and setup times
• Scatter search. Methodology and implementation in C. With CD-ROM.
• Spanning Trees and Optimization Problems
• The traveling salesman problem on cubic and subcubic graphs
• Variable neighborhood scatter search for the incremental graph drawing problem

Cited in

(1)

• General variable neighborhood search for the minimum stretch spanning tree problem

Describes a project that uses

Uses Software

• Scatter Search

This page was built for publication: Scatter search for the minimum leaf spanning tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147145)