Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
27
click to vote
COCOA
2008
Springer
favorite
Email
discuss
report
165
views
Discrete Geometry
»
more
COCOA 2008
»
Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph
14 years 20 days ago
Download
www.utdallas.edu
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial Time Approximation Scheme for CVC in Unit Disk Graph.
Zhao Zhang, Xiaofeng Gao, Weili Wu
Real-time Traffic
COCOA 2008
|
Discrete Geometry
|
NP-hard Problem
|
Polynomial Time Approximation Scheme
|
Vertex Cover Problem
|
claim paper
Related Content
»
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
»
ConstantFactor Approximation for MinimumWeight Connected Dominating Sets in Unit Disk Grap...
»
Approximation Algorithms for Partial Covering Problems
»
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
»
Approximating the minimum clique cover and other hard problems in subtree filament graphs
»
On connected domination in unit ball graphs
»
Bidimensionality and geometric graphs
»
Maintaining a Large Matching or a Small Vertex Cover
»
Approximation Schemes for Minimum 2Connected Spanning Subgraphs in Weighted Planar Graphs
more »
Post Info
More Details (n/a)
Added
18 Oct 2010
Updated
18 Oct 2010
Type
Conference
Year
2008
Where
COCOA
Authors
Zhao Zhang, Xiaofeng Gao, Weili Wu
Comments
(0)
Researcher Info
Discrete Geometry Study Group
Computer Vision