Results 101 to 110 of about 1,232,920 (123)

The Rainbow Steiner Tree Problem

Computers and Operations Research, 2022
Given an undirected and edge-colored graph with non-negative edge lengths, the aim of the Rainbow Steiner Tree Problem (RSTP) is to find a minimum Steiner Tree that uses at most one edge for each color.
Paola Festa, Francesca Guerriero, Daniele Ferone   +2 more
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

On the Exact Solution of Prize-Collecting Steiner Tree Problems

INFORMS Journal on Computing, 2022
Thorsten Koch, Daniel Rehfeldt
exaly  

On approximation algorithms for the terminal Steiner tree problem

Information Processing Letters, 2004
Stefan Hougardy
exaly  

Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems

ACM Transactions on Algorithms, 2020
Fahad Panolan, Saket Saurabh, Fedor Fomin   +2 more
exaly  

On the terminal Steiner tree problem

Information Processing Letters, 2002
Guoliang Xue, Guohui Lin
exaly  

On the hardness of full Steiner tree problems

Journal of Discrete Algorithms, 2015
Anil Maheshwari, Ahmad Biniaz
exaly  

A Branch and Cut Algorithm for a Steiner Tree-Star Problem

INFORMS Journal on Computing, 1996
Youngho Lee, Jennifer Ryan
exaly