scientific article
From MaRDI portal
Publication:2768270
zbMath1018.90038MaRDI QIDQ2768270
Adrian Dumitrescu, Joseph S. B. Mitchell
Publication date: 15 September 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Complexity and performance of numerical algorithms (65Y20)
Related Items
Building bridges between convex regions ⋮ A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring ⋮ Shortest paths in simple polygons with polygon-meet constraints ⋮ Approximation Algorithms for Generalized MST and TSP in Grid Clusters ⋮ Connectivity graphs of uncertainty regions ⋮ Visiting a Polygon on the Optimal Way to a Query Point ⋮ Constant-Factor Approximation for TSP with Disks ⋮ Query-point visibility constrained shortest paths in simple polygons ⋮ Approximation schemes for the generalized traveling salesman problem ⋮ Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
