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

Journal of Computer and System Sciences - United States
doi 10.1006/jcss.1998.1605
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

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 Geometric Intersection Graphs

SIAM Journal on Computing
MathematicsComputer Science
2005English

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

2013English

Baker Game and Polynomial-Time Approximation Schemes

2020English

Two-Stage Stochastic Matching and Spanning Tree Problems: Polynomial Instances and Approximation

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2010English

Reoptimization of NP-Hard Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Exact Algorithms for NP-Hard Problems: A Survey

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Layered Graphs: A Class That Admits Polynomial Time Solutions for Some Hard Problems

2018English

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

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy