Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On approximability of connected path vertex cover

From MaRDI portal
Publication:1644919
Jump to:navigation, search

DOI10.1007/978-3-319-89441-6_2zbMath1504.68164OpenAlexW2795299670MaRDI QIDQ1644919

Toshihiro Fujito

Publication date: 22 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-89441-6_2


zbMATH Keywords

approximation algorithmsconnected vertex coverconnected path vertex cover


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)


Related Items (4)

Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs ⋮ Approximation algorithm for minimum weight connected-\(k\)-subgraph cover ⋮ Approximation algorithm for minimum connected 3-path vertex cover ⋮ Approximation algorithms for minimum weight connected 3-path vertex cover




This page was built for publication: On approximability of connected path vertex cover

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1644919&oldid=13952028"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 05:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki