Work

An approximate solution method based on tabu search for k-minimum spanning tree problems

Year: 2010

Type: article

Source: International Journal of Knowledge Engineering and Soft Data Paradigms

DOI: 10.1504/ijkesdp.2010.035908

Authors: Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishizaki, Jun Ishimatsu

Institution: Hiroshima University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

SDG: Industry, innovation and infrastructure

Open Access status: closed

OpenAlex ID: W2108123796

FWCI: 1.644

Cites: 11

Cited by: 7

Related to: 10