2007•Kyoto University Research Information Repository (Kyoto University)Open access

Studies on approximation algorithms for the minimum vertex cover problem

Tomokazu Imamura

Open full text 0 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Vertex cover, Approximation algorithm, Vertex (graph theory), Cover (algebra), Set cover problem, Algorithm, Computer science, Mathematics

Back to paper search Browse research topics Original source

Studies on approximation algorithms for the minimum vertex cover problem — Research Paper | ScholarLens