Search
Search Results
-
New Algorithms for Steiner Tree Reoptimization
Reoptimization is a setting in which we are given a good approximate solution of an optimization problem instance and a local modification that...
-
Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
In this paper, we address the line-capacitated minimum Steiner tree problem (the Lc-MStT problem, for short), which is a variant of the (Euclidean)...
-
-
Short Cycles Dictate Dichotomy Status of the Steiner Tree Problem on Bisplit Graphs
A graph G is said to be a bisplit graph if its vertex set can be partitioned into a stable set and a complete bipartite graph. The minimum Steiner...
-
-
Correction to: Stronger MIP formulations for the Steiner forest problem
A correction to this paper has been published: https://doi.org/10.1007/s10107-021-01648-9
-
Structural Properties of Minimum Multi-source Multi-Sink Steiner Networks in the Euclidean Plane
Given two finite sets A and B of points in the Euclidean plane, a minimum multi-source multi-sink Steiner network in the plane, or a minimum ( A , B )-ne...
-
Implications, conflicts, and reductions for Steiner trees
The Steiner tree problem in graphs (SPG) is one of the most studied problems in combinatorial optimization. In the past 10 years, there have been...
-
An ETH-Tight Algorithm for Bidirected Steiner Connectivity
In the Strongly Connected Steiner Subgraph problem, we are given an n-vertex digraph D, a weight function...
-
Stronger MIP formulations for the Steiner forest problem
The Steiner forest problem asks for a minimum weight forest that spans a given number of terminal sets. We propose new cut- and flow-based integer...
-
The m-Steiner Traveling Salesman Problem with online edge blockages
We consider the online multiple Steiner Traveling Salesman Problem based on the background of the delivery of packages in an urban traffic network....
-
BIG DATA for Small Tree Squirrels in Old-Growth Forests? Landscape Metrics, Open Access Field Data, Machine Learning, and GIS Models from Remotely-Sensed Imagery in the Tanana Valley State Forest Wilderness of Alaska
This study aims to provide a specific predictive example for tree squirrel middens and the corresponding squirrel presence distribution of the North...
-
Studies of Family Forest Owners in the USA: A Systematic Review of Literature from 2000 through 2019
In the USA, there are an estimated 9.6 million families, individuals, trusts, estates, and family partnerships, collectively referred to as family...
-
Approximation Algorithms for Priority Steiner Tree Problems
In the Priority Steiner Tree (PST) problem, we are given an undirected graph...
-
Approximation of Steiner forest via the bidirected cut relaxation
The classical algorithm of Agrawal et al. (SIAM J Comput 24(3):440–456,
1995 ), stated in the setting of the primal-dual schema by Goemans and...
-
IPM: The Forest Context
Integrated pest management (IPM) is perhaps best described as “…the maintenance of destructive agents, including insects, at tolerable levels by the...
-
Restoration of Damaged Forest and Roles of Remote Sensing
Ecological damage refers to the reduction in the value of the environment due to human activities and natural disasters such as climate change and...
-
Robust Reoptimization of Steiner Trees
In reoptimization, one is given an optimal solution to a problem instance and a (locally) modified instance. The goal is to obtain a solution for the...
-
An optimization approach to design forest road networks and plan timber transportation
The provision of ecosystem services depends on the landscape-level distribution of forest management options over extended planning horizons....
-
Quantum Speedup for the Minimum Steiner Tree Problem
A recent breakthrough by Ambainis, Balodis, Iraids, Kokainis, Prūsis and Vihrovs (SODA’19) showed how to construct faster quantum algorithms for the...