Baker Game and Polynomial-Time Approximation Schemes

doi 10.1137/1.9781611975994.137
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

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

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

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

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

2013English

Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in H-Free Graphs

2020English

Approximation Schemes for Preemptive Weighted Flow Time

2002English

A Polynomial Time Approximation Scheme Fork-Consensus Clustering

2010English

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

2019English

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

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

Privacy PolicyRefund Policy