A 1.5-Approximation for Path TSP

doi 10.1137/1.9781611975482.93
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

A Deterministic Approximation Algorithm for Maximum 2-Path Packing

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2010English

Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Approximation Algorithms and Heuristics for a 2-Depot, Heterogeneous Hamiltonian Path Problem

International Journal of Robust and Nonlinear Control
ControlSystems EngineeringIndustrialMechanical EngineeringElectronic EngineeringManufacturing EngineeringElectricalChemical EngineeringBiomedical EngineeringAerospace Engineering
2011English

A Randomness Ant Colony Algorithm for Solving TSP

DEStech Transactions on Computer Science and Engineering
2017English

Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Approximation and Relaxation of Semantic Web Path Queries

SSRN Electronic Journal
2016English

Nuclear Level Densities in the Static-Path Approximation

Physical Review Letters
AstronomyPhysics
1988English

A New Path Integral Approximation to Photon Propagation in Turbid Media

Waves in Random and Complex Media
EngineeringAstronomyPhysics
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy