Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
From MaRDI portal
Publication:5313047
DOI10.1007/b99805zbMath1106.90061OpenAlexW4301133941MaRDI QIDQ5313047
Publication date: 25 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99805
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (21)
Traveling salesman problems in temporal graphs ⋮ A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem ⋮ Constant Factor Approximation for ATSP with Two Edge Weights ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective ⋮ Three-Bar Charts Packing Problem ⋮ Minimum-Weight Cycle Covers and Their Approximability ⋮ An improved approximation for packing big two-bar charts ⋮ On Eulerian extensions and their application to no-wait flowshop scheduling ⋮ New Approximation Algorithms for (1,2)-TSP ⋮ New inapproximability bounds for TSP ⋮ Maximum ATSP with weights zero and one via half-edges ⋮ Deterministic Algorithms for Multi-criteria TSP ⋮ Restricted Common Superstring and Restricted Common Supersequence ⋮ Improved integrality gap upper bounds for traveling salesperson problems with distances one and two ⋮ Unnamed Item ⋮ Deterministic algorithms for multi-criteria max-TSP ⋮ Approximation of the double traveling salesman problem with multiple stacks ⋮ Constant factor approximation for ATSP with two edge weights ⋮ Approximation algorithms for multi-criteria traveling salesman problems ⋮ Minimum-weight cycle covers and their approximability ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective*
This page was built for publication: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
