Solving Steiner trees: Recent advances, challenges, and perspectives
I Ljubić - Networks, 2021 - Wiley Online Library
The Steiner tree problem (STP) in graphs is one of the most studied problems in
combinatorial optimization. Since its inception in 1970, numerous articles published in the …
combinatorial optimization. Since its inception in 1970, numerous articles published in the …
Customized bus service design for jointly optimizing passenger-to-vehicle assignment and vehicle routing
Emerging transportation network services, such as customized buses, hold the promise of
expanding overall traveler accessibility in congested metropolitan areas. A number of …
expanding overall traveler accessibility in congested metropolitan areas. A number of …
Chapter 10: Vehicle routing problems with profits
10.1▪ Introduction The key characteristic of the class of Vehicle Routing Problems with Profits
(VRPPs) is that, contrary to what happens for the most classical vehicle routing problems …
(VRPPs) is that, contrary to what happens for the most classical vehicle routing problems …
An improved LP-based approximation for Steiner tree
The Steiner tree problem is one of the most fundamental NP-hard problems: given a
weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree …
weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree …
Steiner tree approximation via iterative randomized rounding
The Steiner tree problem is one of the most fundamental NP-hard problems: given a
weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree …
weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree …
Underwater data collection using robotic sensor networks
We examine the problem of utilizing an autonomous underwater vehicle (AUV) to collect
data from an underwater sensor network. The sensors in the network are equipped with …
data from an underwater sensor network. The sensors in the network are equipped with …
A Systematic Review of Approximability Results for Traveling Salesman Problems leveraging the TSP-T3CO Definition Scheme
The traveling salesman (or salesperson) problem, short TSP, is a problem of strong interest
to many researchers from mathematics, economics, and computer science. Manifold TSP …
to many researchers from mathematics, economics, and computer science. Manifold TSP …
Event detection in activity networks
With the fast growth of smart devices and social networks, a lot of computing systems collect
data that record different types of activities. An important computational challenge is to …
data that record different types of activities. An important computational challenge is to …
Improving Christofides' algorithm for the st path TSP
HC An, R Kleinberg, DB Shmoys - Journal of the ACM (JACM), 2015 - dl.acm.org
We present a deterministic (1+√ 5/2)-approximation algorithm for the st path TSP for an
arbitrary metric. Given a symmetric metric cost on n vertices including two prespecified …
arbitrary metric. Given a symmetric metric cost on n vertices including two prespecified …
Autonomous data collection using a self-organizing map
J Faigl, GA Hollinger - IEEE transactions on neural networks …, 2017 - ieeexplore.ieee.org
The self-organizing map (SOM) is an unsupervised learning technique providing a
transformation of a high-dimensional input space into a lower dimensional output space. In …
transformation of a high-dimensional input space into a lower dimensional output space. In …