P-complete problems and approximate solutions

Authors:
Sartaj Sahni;Teofilo Gonzales
Affiliations:
-;-
Venue:
SWAT '74 Proceedings of the 15th Annual Symposium on Switching and Automata Theory (swat 1974)
Year:
1974

Citing 0
Cited 4

Some complexity results for the Traveling Salesman Problem

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
An Effective Evolutionary Algorithm for the Cumulative Capacitated Vehicle Routing Problem

EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
Multi-robot routing with linear decreasing rewards over time

ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
ReFHap: a reliable and fast algorithm for single individual haplotyping

Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the class of P-Complete problems and show the following: i) for any constant ε 0 there is a P-complete problem for which an ε-approximate solution can be found in linear time ii) there exist P-Complete problems for which linear time approximate solutions that get closer and closer to the optimal (with increasing problem size) can be found iii) there exist P-Complete problems for which the approximation problems are also P-Complete.