scientific article; zbMATH DE number 7662164

DOI10.57717/cgt.v1i1.17MaRDI QIDQ5881545

Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid

Publication date: 10 March 2023

Full work available at URL: https://arxiv.org/abs/2111.05780

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

metric spaceapproximation algorithmsNP-hardnessbottleneck spanning treespartitioned point sets

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the Maximally Balanced Connected Partition Problem in graphs
• Survivable networks, linear programming relaxations and the parsimonious property
• On the complexity of partitioning graphs into connected subgraphs
• Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
• The Min-Max Spanning Tree Problem and some extensions
• \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
• Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
• Selecting and covering colored points
• A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree
• A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
• On minimum- and maximum-weight minimum spanning trees with neighborhoods
• Connectivity graphs of uncertainty regions
• Minmax subtree cover problem on cacti
• Graphs with 1-hamiltonian-connected cubes
• Hamiltonian Paths in the Square of a Tree
• Approximation Algorithms for Generalized MST and TSP in Grid Clusters
• Polylogarithmic inapproximability
• Minimum-diameter covering problems
• On Representatives of Subsets
• BALANCED PARTITION OF MINIMUM SPANNING TREES
• On the generalized minimum spanning tree problem
• Algorithms and Computation
• A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane
• On the Cube of a Graph
• Minmax Tree Cover in the Euclidean Space
• Approximation algorithms for maximally balanced connected graph partition

This page was built for publication: