scientific article; zbMATH DE number 871910
From MaRDI portal
Publication:4875179
zbMath0845.90122MaRDI QIDQ4875179
Michel X. Goemans, Jon M. Kleinberg
Publication date: 16 September 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
Polynomial time algorithms for some minimum latency problems ⋮ Improved approximation algorithms for the spanning star forest problem ⋮ On the existence of schedules that are near-optimal for both makespan and total weighted completion time ⋮ On-line load balancing for related machines ⋮ News from the online traveling repairman. ⋮ Pricing commodities ⋮ Approximating the \(k\)-traveling repairman problem with repair times ⋮ Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems ⋮ Incremental medians via online bidding ⋮ A metaheuristic for the delivery man problem with time windows ⋮ An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem ⋮ New algorithms for related machines with temporary jobs. ⋮ A constant-factor approximation algorithm for the \(k\)-MST problem
This page was built for publication:
