scientific article
From MaRDI portal
Publication:2934576
zbMath1302.68322arXiv1703.01646MaRDI QIDQ2934576
Publication date: 18 December 2014
Full work available at URL: https://arxiv.org/abs/1703.01646
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items
A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring, On the minimum corridor connection problem and other generalized geometric problems, Controlled mobility in stochastic and dynamic wireless networks, Connectivity graphs of uncertainty regions, Algorithms for interval structures with applications, Constant-Factor Approximation for TSP with Disks, Unnamed Item, The Shortest Separating Cycle Problem, Minimum covering with travel cost, A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics, Algorithms for Interval Structures with Applications, Approximation schemes for the generalized traveling salesman problem, Cooperative TSP, Computing shortest heterochromatic monotone routes, Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters, The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme
