Analysis of set-up time models: a metric perspective
From MaRDI portal
Recommendations
Cites work
- 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
- A \(\frac78\)-approximation algorithm for metric Max TSP
- Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- Clustering for edge-cost minimization (extended abstract)
- Expander flows, geometric embeddings and graph partitioning
- Fourier Integrals and Metric Geometry
- scientific article; zbMATH DE number 3854475 (Why is no real title available?)
- scientific article; zbMATH DE number 3461056 (Why is no real title available?)
- scientific article; zbMATH DE number 4124976 (Why is no real title available?)
- scientific article; zbMATH DE number 863510 (Why is no real title available?)
- Least-distortion Euclidean embeddings of graphs: Products of cycles and expanders
- Metric spaces and completely monontone functions
- On the Optimality of the Probability Ranking Scheme in Storage Applications
- Placement of Records on a Secondary Storage Device to Minimize Access Time
- The Effect of a Capacity Constraint on the Minimal Cost of a Partition
- The Renewal Model for Program Behavior
- Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
This page was built for publication: Analysis of set-up time models: a metric perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q935161)