Pages that link to "Item:Q5313047"
From MaRDI portal
The following pages link to Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313047):
Displaying 22 items.
- Traveling salesman problems in temporal graphs (Q284573) (← links)
- New inapproximability bounds for TSP (Q494069) (← links)
- Deterministic algorithms for multi-criteria max-TSP (Q713324) (← links)
- Approximation algorithms for multi-criteria traveling salesman problems (Q1017906) (← links)
- Minimum-weight cycle covers and their approximability (Q1028118) (← links)
- Maximum ATSP with weights zero and one via half-edges (Q1743116) (← links)
- Improved integrality gap upper bounds for traveling salesperson problems with distances one and two (Q1754106) (← links)
- Constant factor approximation for ATSP with two edge weights (Q1801010) (← links)
- Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
- On Eulerian extensions and their application to no-wait flowshop scheduling (Q2434285) (← links)
- Approximability of the multiple stack TSP (Q2861493) (← links)
- Deterministic Algorithms for Multi-criteria TSP (Q3010407) (← links)
- Restricted Common Superstring and Restricted Common Supersequence (Q3011876) (← links)
- Constant Factor Approximation for ATSP with Two Edge Weights (Q3186505) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective (Q3464477) (← links)
- Minimum-Weight Cycle Covers and Their Approximability (Q3508566) (← links)
- New Approximation Algorithms for (1,2)-TSP (Q5002675) (← links)
- A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem (Q5054168) (← links)
- An improved approximation algorithm for ATSP (Q5144891) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective<sup>*</sup> (Q5856438) (← links)
- An improved approximation for packing big two-bar charts (Q6187994) (← links)
- Improved approximation algorithms for the \(k\)-path partition problem (Q6635814) (← links)
