Vertex Cover: Further Observations and Further Improvements
β Scribed by Jianer Chen; Iyad A. Kanj; Weijia Jia
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 172 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
β¦ Synopsis
Recently, there has been increasing interest and progress in lowering the worstcase time complexity for well-known NP-hard problems, particularly for the Vertex Cover problem. In this paper, new properties for the Vertex Cover problem are indicated, and several simple and new techniques are introduced, which lead to an improved algorithm of time O kn + 1 2852 k for the problem. Our algorithm also induces improvement on previous algorithms for the Independent Set problem on graphs of small degree.
π SIMILAR VOLUMES
## Abstract The phase cycle for the FLOCK experiment was modified to provide improved suppression of artifacts and improved signalβtoβnoise ratios. An alternative version of FLOCK in which the initial BIRD pulse during __t__~1~ is replaced by a oneβstep __J__ filter is shown to give comparable perf
## Abstract An autosomal recessive disorder characterized by intrauterine growth retardation, postnatal retardation, microcephaly, sparse hair, toe syndactyly, and characteristic facial appearance is now recognized as the Dubowitz syndrome. Five addition additional cases of the Dubowitz syndrome ar
## Electronic Highway Now Open; Further Improvements Coming ew trading patterns are emerging as the N gas industry restructures itself, creating needs for new information systems. To the surprise of no one who believes in the power of competitive markets, state-of-the-art information systems are n