Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleAugust 2024
- research-articleJuly 2024
An exact algorithm for the Euclidean k-Steiner tree problem
Computational Geometry: Theory and Applications (COGE), Volume 121, Issue CAug 2024https://doi.org/10.1016/j.comgeo.2024.102099AbstractThe Euclidean k-Steiner tree problem asks for a minimum-cost network connecting n given points in the plane, allowing at most k additional nodes referred to as Steiner points. In the classical Steiner tree problem in which there is no restriction ...
- research-articleJune 2024
Prize-Collecting Steiner Tree: A 1.79 Approximation
STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of ComputingJune 2024, Pages 1641–1652https://doi.org/10.1145/3618260.3649789Prize-Collecting Steiner Tree (PCST) is a generalization of the Steiner Tree problem, a fundamental problem in computer science. In the classic Steiner Tree problem, we aim to connect a set of vertices known as terminals using the minimum-weight tree in ...
- research-articleFebruary 2024
Edge data distribution as a network Steiner tree estimation in edge computing
Computing (CMPT), Volume 106, Issue 5May 2024, Pages 1585–1609https://doi.org/10.1007/s00607-024-01259-0AbstractMany modern day cloud hosted applications such as virtual reality, real time games require low latency data access and computation to improve response time. So it is essential to bring the computation and data storage edge servers closer to the ...
-
- research-articleDecember 2023
On the complexity of the Cable-Trench Problem
Discrete Applied Mathematics (DAMA), Volume 340, Issue CDec 2023, Pages 272–285https://doi.org/10.1016/j.dam.2023.07.010AbstractThe Cable-Trench Problem (CTP) is a common generalization of the Single-Source Shortest Paths Problem (SSSP) and the Minimum Spanning Tree Problem (MST): given an edge-weighted graph with a special root vertex and parameters τ , γ ≥ 0, the goal ...
- research-articleNovember 2023
Distributed approximate minimal Steiner trees with millions of seed vertices on billion-edge graphs
Journal of Parallel and Distributed Computing (JPDC), Volume 181, Issue CNov 2023https://doi.org/10.1016/j.jpdc.2023.104717AbstractIn this paper, we present a parallel 2-approximation Steiner minimal tree algorithm and its MPI-based distributed implementation. In place of expensive distance computations between all pairs of seed vertices, the solution we employ ...
Graphical abstract Highlights- Voronoi cell computation is an enabler for scaling to large graphs and seed sets.
- research-articleMarch 2023
Robust Algorithms for TSP and Steiner Tree
ACM Transactions on Algorithms (TALG), Volume 19, Issue 2Article No.: 12, Pages 1–37https://doi.org/10.1145/3570957Robust optimization is a widely studied area in operations research, where the algorithm takes as input a range of values and outputs a single solution that performs well for the entire range. Specifically, a robust algorithm aims to minimize regret, ...
- research-articleDecember 2022
Revising Johnson’s table for the 21st century
Discrete Applied Mathematics (DAMA), Volume 323, Issue CDec 2022, Pages 184–200https://doi.org/10.1016/j.dam.2021.05.021AbstractWhat does it mean today to study a problem from a computational point of view? We focus on parameterized complexity and on Column 16 “Graph Restrictions and Their Effect” of D.S. Johnson’s Ongoing guide, where several puzzles were ...
- research-articleSeptember 2022
- ArticleJanuary 2023
Approximation Algorithms for Prize-Collecting Capacitated Network Design Problems
AbstractIn this paper, we study the prize-collecting capacitated network design (PCCND) problem. We have to route the demand of each source to some sinks in a network, or eventually pay the prize to not serving the demand. We need to install multiple ...
- research-articleAugust 2022
- research-articleJune 2022
Linear-Delay Enumeration for Minimal Steiner Problems
PODS '22: Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsJune 2022, Pages 301–313https://doi.org/10.1145/3517804.3524148Kimelfeld and Sagiv [Kimelfeld and Sagiv, PODS 2006], [Kimelfeld and Sagiv, Inf. Syst. 2008] pointed out that the problem of enumerating K-fragments is of great importance in a keyword search on data graphs. In a graph-theoretic term, the problem ...
- research-articleJune 2022
Load-balance scheduling for intelligent sensors deployment in industrial internet of things
Cluster Computing (KLU-CLUS), Volume 25, Issue 3Jun 2022, Pages 1715–1727https://doi.org/10.1007/s10586-021-03316-1AbstractThe Industrial Internet of Things uses intelligent sensors to collect the physical properties of objects placed on a large area. It provides innovative service and network functioning, such as time-bounded data delivery and efficient sensor sleep ...
- research-articleMay 2022
- ArticleApril 2022
Tracking the Evolution: Discovering and Visualizing the Evolution of Literature
Database Systems for Advanced ApplicationsApr 2022, Pages 68–84https://doi.org/10.1007/978-3-031-00129-1_5AbstractA common task in research preparation is to survey related work in bibliographic databases. Scientists are finding the survey task notably difficult as the volume of the databases has been increased considerably over the past few decades. Making a ...
- rapid-communicationMarch 2022
Two-level hub Steiner trees
Information Processing Letters (IPRL), Volume 174, Issue CMar 2022https://doi.org/10.1016/j.ipl.2021.106209Highlights- We show both the NP-hardness and logarithmic approximation hardness of hub spanning tree by a reduction from the set cover problem.
We study a fundamental class of two-layer network design problems. A hub layer is configured by establishing hubs at selected nodes at considerable cost so that the routes between hubs can be operated cheaply. The remaining edges in ...
- research-articleMarch 2022
The Rainbow Steiner Tree Problem
Computers and Operations Research (CORS), Volume 139, Issue CMar 2022https://doi.org/10.1016/j.cor.2021.105621AbstractGiven 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. In this paper, the RSTP is ...
- ArticleFebruary 2022
P Versus NPC: Minimum Steiner Trees in Convex Split Graphs
Algorithms and Discrete Applied MathematicsFeb 2022, Pages 115–126https://doi.org/10.1007/978-3-030-95018-7_10AbstractWe investigate the complexity of finding a minimum Steiner tree in new subclasses of split graphs namely tree-convex split graphs and circular-convex split graphs. It is known that the Steiner tree problem (STREE) is NP-complete on split graphs [1]...
- research-articleJanuary 2022
Fully Dynamic Algorithm for Steiner Tree using Dynamic Distance Oracle
ICDCN '22: Proceedings of the 23rd International Conference on Distributed Computing and NetworkingJanuary 2022, Pages 246–247https://doi.org/10.1145/3491003.3491304In this paper, we propose a fully dynamic algorithm for the Steiner tree problem in a planar graph. We consider a planar edge-weighted undirected graph with positive real edge weights and a set of updates including edge insertion/deletion. The goal is ...