Uniform-Circuit and Logarithmic-Space Approximations of Refined Combinatorial Optimization Problems

We lay out a refined framework to discuss various approximation algorithms for combinatorial optimization problems residing inside the optimization class PO. We are focused on optimization problems characterized by computation models of uniform NC1-circuits, uniform-AC0, and logarithmic-space Turing...

Full description

Saved in:
Bibliographic Details
Published inCombinatorial Optimization and Applications pp. 318 - 329
Main Author Yamakami, Tomoyuki
Format Book Chapter
LanguageEnglish
Japanese
Published Cham Springer International Publishing 2013
SeriesLecture Notes in Computer Science
Subjects
approximation algorithm
approximation-preserving reduction
circuit
logarithmic space
optimization problem
Online AccessGet full text

Cover

More Information
Summary:We lay out a refined framework to discuss various approximation algorithms for combinatorial optimization problems residing inside the optimization class PO. We are focused on optimization problems characterized by computation models of uniform NC1-circuits, uniform-AC0, and logarithmic-space Turing machines. We present concrete optimization problems and prove that they are indeed complete under reasonably weak reductions. We also show collapses and separations among refined optimization classes.
ISBN:9783319037790
331903779X
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-03780-6_28