Analysis of set-up time models: a metric perspective
From MaRDI portal
Publication:935161
DOI10.1016/j.tcs.2008.04.021zbMath1146.68023OpenAlexW2003635579MaRDI QIDQ935161
Avner Magen, Eitan Bachmat, Tao Kai Lam
Publication date: 31 July 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.04.021
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A \(\frac78\)-approximation algorithm for metric Max TSP
- Least-distortion Euclidean embeddings of graphs: Products of cycles and expanders
- Metric spaces and completely monontone functions
- Clustering for edge-cost minimization (extended abstract)
- Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
- Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
- The Effect of a Capacity Constraint on the Minimal Cost of a Partition
- The Renewal Model for Program Behavior
- On the Optimality of the Probability Ranking Scheme in Storage Applications
- Placement of Records on a Secondary Storage Device to Minimize Access Time
- Fourier Integrals and Metric Geometry
- Expander flows, geometric embeddings and graph partitioning
This page was built for publication: Analysis of set-up time models: a metric perspective
