Scatter search for the minimum leaf spanning tree problem
From MaRDI portal
Publication:2147145
DOI10.1016/J.COR.2022.105858OpenAlexW4280544294WikidataQ114193066 ScholiaQ114193066MaRDI QIDQ2147145FDOQ2147145
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
Recommendations
- scientific article; zbMATH DE number 1439455
- 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
- scientific article; zbMATH DE number 1670813
- Minimum spanning hypertrees
- A randomized linear-time algorithm for finding minimum spanning trees (extended abstract)
Cites Work
- Title not available (Why is that?)
- Multi-objective optimization using evolutionary algorithms
- Scatter search. Methodology and implementation in C. With CD-ROM.
- The traveling salesman problem on cubic and subcubic graphs
- Relations, models and a memetic approach for three degree-dependent spanning tree problems
- On finding spanning trees with few leaves
- Lower and upper bounds for the spanning tree with minimum branch vertices
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
- Scatter search with path relinking for the job shop with time lags and setup times
- Spanning Trees and Optimization Problems
- Scatter Search and Path Relinking: Advances and Applications
- A survey on algorithms for the maximum internal spanning tree and related problems
- Scatter search for the bandpass problem
- Minimal congestion trees
- Complexities of some interesting problems on spanning trees
- Approximation Algorithms for the Maximum Internal Spanning Tree Problem
- Algorithms and Data Structures
- Approximating the maximum internal spanning tree problem
- Better approximation algorithms for the maximum internal spanning tree problem
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
- Complexity of independency and cliquy trees
- Variable neighborhood scatter search for the incremental graph drawing problem
- 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
- On the minimum leaf number of cubic graphs
- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs
Cited In (1)
Uses Software
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)
