Constrained TSP and low-power computing

DOI10.1007/3-540-63307-3_51zbMath1497.68571OpenAlexW1827131769MaRDI QIDQ5096929

Prabhakar Raghavan, Craig Silverstein, Moses Charikar

Publication date: 19 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63307-3_51

zbMATH Keywords

approximation algorithmcompetitive ratioregular solutionprecedence constraintbasic block

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (2)

An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers ⋮ Serving rides of equal importance for time-limited dial-a-ride

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing setups in ordered sets of fixed width
• HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM
• Competitive algorithms for server problems
• Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming
• On the approximation of shortest common supersequences and longest common subsequences

This page was built for publication: Constrained TSP and low-power computing