Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems

We study constant-time approximation algorithms for bounded-degree graphs, which run in time independent of the number of vertices $n$. We present an algorithm that decides whether a vertex is contained in a some fixed maximal independent set with expected query complexity $O(d^2)$, where $d$ is the...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on computing Vol. 41; no. 4; pp. 1074 - 1093
Main Authors: Yoshida, Yuichi, Yamamoto, Masaki, Ito, Hiro
Format: Journal Article
Language:English
Published: Philadelphia Society for Industrial and Applied Mathematics 01.01.2012
Subjects:
Algorithms
Approximation
Errors
Graphs
Informatics
Matching
Mathematical analysis
Optimization
Queries
Query processing
ISSN:0097-5397, 1095-7111
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first