Approximation Schemes Using L-Reductions

Authors:
Harry B. Hunt, III;Madhav V. Marathe;Venkatesh Radhakrishnan;S. S. Ravi;Daniel J. Rosenkrantz;Richard Edwin Stearns
Affiliations:
-;-;-;-;-;-
Venue:
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
Year:
1994

Citing 0
Cited 5

Towards a syntactic characterization of PTAS

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems

Information and Computation
A Short Guide To Approximation Preserving Reductions

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
On computational complexity of counting fixed points in symmetric boolean graph automata

UC'05 Proceedings of the 4th international conference on Unconventional Computation
Shifting strategy for geometric graphs without geometry

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract