Minimum vertex cover in ball graphs through local search

Zhao Zhang (), Weili Wu, Lidan Fan and Ding-Zhu Du

Journal of Global Optimization, 2014, vol. 59, issue 2, 663-671

Abstract: Using local search method, this paper provides a polynomial time approximation scheme for the minimum vertex cover problem on $$d$$ d -dimensional ball graphs where $$d \ge 3$$ d ≥ 3 . The key to the proof is a new separator theorem for ball graphs in higher dimensional space. Copyright Springer Science+Business Media New York 2014

Keywords: Vertex cover; Ball graph; Local search; Separator theorem (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10898-013-0116-4 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:59:y:2014:i:2:p:663-671

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-013-0116-4

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().