A Fully Polynomial Time Approximation Scheme for Packing While Traveling

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-030-19759-9_5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

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

2009English

A Polynomial Time Approximation Scheme Fork-Consensus Clustering

2010English

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

2013English

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

2019English

A Polynomial Time Constant Approximation for Minimizing Total Weighted Flow-Time

2019English

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
MathematicsComputer Science
2005English

Polynomial-Time Approximation Schemes for Scheduling Problems With Time Lags

Journal of Scheduling
Management ScienceEngineeringOperations ResearchArtificial IntelligenceSoftware
2009English

Baker Game and Polynomial-Time Approximation Schemes

2020English

Duality Gap Estimation and Polynomial Time Approximation for Optimal Spectrum Management

IEEE Transactions on Signal Processing
Electronic EngineeringSignal ProcessingElectrical
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy