Fundamentals of Computation Theory
From MaRDI portal
Publication:5492955
DOI10.1007/11537311zbMath1122.90084OpenAlexW2491671784MaRDI QIDQ5492955
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11537311
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (3)
Approximation results for the weighted \(P_4\) partition problem ⋮ New Approximation Algorithms for (1,2)-TSP ⋮ Improved integrality gap upper bounds for traveling salesperson problems with distances one and two
This page was built for publication: Fundamentals of Computation Theory