scientific article; zbMATH DE number 3588048
From MaRDI portal
Publication:4155835
Cited in
(69)- The structure of minimal Steiner trees in the neighborhoods of the lunes of their edges
- Sums of square roots that are close to an integer
- The computational complexity of trembling hand perfection and other equilibrium refinements
- Tractability conditions for numeric CSPs
- Approximating maxmin strategies in imperfect recall games using A-loss recall property
- The shortest separating cycle problem
- Fast geometric approximation techniques and geometric embedding problems
- Approximate equality for two sums of roots
- An estimate of the objective function optimum for the network Steiner problem
- Solving a selective dial-a-ride problem with logic-based Benders decomposition
- A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing
- Rearranging data to maximize the efficiency of compression
- Cooperative TSP
- Faster algorithms for orienteering and \(k\)-TSP
- Minimal binary trees with a regular boundary: The case of skeletons with five endpoints
- The Complexity of Nash Equilibria in Limit-Average Games
- On the transformation capability of feasible mechanisms for programmable matter
- Financial networks with singleton liability priorities
- Optimal search with positive switch cost is NP-hard
- Watchman tours for polygons with holes
- The Euclidean traveling salesman problem is NP-complete
- Linear index coding via semidefinite programming
- Observation routes and external watchman routes
- On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight
- Watchman routes for lines and line segments
- Equilibria, fixed points, and complexity classes
- Hard to solve instances of the Euclidean traveling salesman problem
- The traveling salesman problem on grids with forbidden neighborhoods
- The simultaneous semi-random model for TSP
- The algebraic degree of geometric optimization problems
- Efficient algorithms for sparse cyclotomic integer zero testing
- On Euclidean vehicle routing with allocation
- Constraint satisfaction problems over numeric domains
- Constant-factor approximation for TSP with disks
- Recursive Markov decision processes and recursive stochastic games
- scientific article; zbMATH DE number 7455732 (Why is no real title available?)
- Observation routes and external watchman routes
- Good triangulations yield good tours
- Probabilistic analysis of some Euclidean clustering problems
- On the Order of Power Series and the Sum of Square Roots Problem
- The simultaneous semi-random model for TSP
- Vehicle routing on road networks: how good is Euclidean approximation?
- Complexity of rational and irrational Nash equilibria
- NP-completeness of the Hamming salesman problem
- An optimal solution to a wire-routing problem
- A problem that is easier to solve on the unit-cost algebraic RAM
- Time complexity of the analyst's traveling salesman algorithm
- Bounding the sum of square roots via lattice reduction
- Identity testing for radical expressions
- The kissing problem: how to end a gathering when everyone kisses everyone else goodbye
- Directional derivative of the weight of a minimal filling in Riemannian manifolds
- Strategies for generating well centered tetrahedral meshes on industrial geometries
- Querying probabilistic business processes for sub-flows
- Worst-case minimum rectilinear Steiner trees in all dimensions
- The traveling salesman problem with few inner points
- The optimum assignments and a new heuristic approach for the traveling salesman problem
- Probabilistic analysis of solving the assignment problem for the traveling salesman problem
- Approximation schemes for node-weighted geometric Steiner tree problems
- Financial networks with singleton liability priorities
- A fast algorithm for Steiner trees
- Euclidean TSP in narrow strips
- On the computational complexity of centers locating in a graph
- Minimum rectilinear Steiner tree of n points in the unit square
- Approximation Algorithms for the Traveling Salesman Problem with Range Condition
- Approximation algorithms for the Geometric Covering Salesman Problem
- Algebraic optimization: The Fermat-Weber location problem
- Asymptotic expected performance of some TSP heuristics: An empirical evaluation
- An ETH-Tight Exact Algorithm for Euclidean TSP
- Multi-shuttle crane scheduling in automated storage and retrieval systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4155835)
