scientific article; zbMATH DE number 871910
From MaRDI portal
Publication:4875179
zbMATH Open0845.90122MaRDI QIDQ4875179FDOQ4875179
Authors: Michel X. Goemans, Jon M. Kleinberg 
Publication date: 16 September 1996
Title of this publication is not available (Why is that?)
Recommendations
Cited In (25)
- Incremental medians via online bidding
- A Faster, Better Approximation Algorithm for the Minimum Latency Problem
- Improved approximation algorithms for the spanning star forest problem
- Approximation Schemes for Minimum Latency Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- News from the online traveling repairman.
- A constant-factor approximation algorithm for the \(k\)-MST problem
- New algorithms for related machines with temporary jobs.
- Title not available (Why is that?)
- Minimizing latency of capacitated \(k\)-tours
- On-line load balancing for related machines
- Polynomial time algorithms for some minimum latency problems
- The Directed Minimum Latency Problem
- Approximation algorithms for maximum latency and partial cycle cover
- A metaheuristic for the delivery man problem with time windows
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time
- Pricing commodities
- Title not available (Why is that?)
- An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem
- Facility location with client latencies: linear programming based techniques for minimum latency problems
- A simple and effective metaheuristic for the minimum latency problem
- Approximation schemes for minimum latency problems
- Title not available (Why is that?)
- Approximating the \(k\)-traveling repairman problem with repair times
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875179)
