AI Chat AI Image Generator AI Video Text to Speech

Solving group Steiner problems as Steiner problems: the rigorous proof

11/29/2018

∙

by Yahui Sun, et al.

∙

∙

The Steiner tree problems are well-known NP-hard problems that have diverse applications. Duin et al. (2004) have intuitively proposed the widely-used transformation from the classical group Steiner tree problem to the classical Steiner tree problem in graphs. This transformation has not been rigorously proven so far. Specifically, the large M value that is used in this transformation has not been specified. In this paper, we address this issue by rigorously prove this transformation for a specific large M value.

research

∙ 02/19/2019

Travelling on Graphs with Small Highway Dimension

We study the Travelling Salesperson (TSP) and the Steiner Tree problem (...

0 Yann Disser, et al. ∙

research

∙ 08/25/2022

Learning to Prune Instances of Steiner Tree Problem in Graphs

We consider the Steiner tree problem on graphs where we are given a set ...

4 Jiwei Zhang, et al. ∙

research

∙ 11/04/2022

Steiner connectivity problems in hypergraphs

We say that a tree T is an S-Steiner tree if S ⊆ V(T) and a hypergraph i...

0 Florian Hörsch, et al. ∙

research

∙ 06/27/2023

Error analyses of Sinc-collocation methods for exponential decay initial value problems

Nurmuhammad et al. developed the Sinc-Nyström methods for initial value ...

0 Tomoaki Okayama, et al. ∙

research

∙ 12/12/2022

Degreewidth: a New Parameter for Solving Problems on Tournaments

In the paper, we define a new parameter for tournaments called degreewid...

0 Tom Davot, et al. ∙

research

∙ 03/12/2020

Identification in a Fully Nonparametric Transformation Model with Heteroscedasticity

The so far most general identification result in the context of nonparam...

0 Nick Kloodt, et al. ∙

research

∙ 01/07/2021

Towards Optimally Efficient Tree Search with Deep Temporal Difference Learning

This paper investigates the classical integer least-squares problem whic...

13 Ke He, et al. ∙