Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems.

doi 10.1137/1.9781611973402.46

Full Text

Abstract

Available in

Date

Authors

Publisher

Society for Industrial and Applied Mathematics

Related search

Polynomial-Time Approximation Schemes for Scheduling Problems With Time Lags

Journal of Scheduling
Management ScienceEngineeringOperations ResearchArtificial IntelligenceSoftware
2009English

Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1999English

Baker Game and Polynomial-Time Approximation Schemes

2020English

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
MathematicsComputer Science
2005English

A Fully Polynomial Time Approximation Scheme for Packing While Traveling

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-complete Problems

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1987English

A Polynomial Time Interior Point Algorithm for Minimum Cost Flow Problems

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1990English

Polynomial-Time Approximation Scheme for Minimum K-Cut in Planar and Minor-Free Graphs

2019English

A Fully Polynomial Time Approximation Scheme for Timing Driven Minimum Cost Buffer Insertion

2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy