Approximating the minimum hub cover problem on planar graphs
DOI10.1007/S11590-015-0876-5zbMATH Open1339.90292OpenAlexW2133597921MaRDI QIDQ5963689FDOQ5963689
ล. ฤฐlker Birbil, Hasan M. Jamil, Kerem Bรผlbรผl, Belma Yelbay
Publication date: 23 February 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0876-5
approximation algorithmsubgraph isomorphismquery processingplanar graph decompositionminimum hub cover problem
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- An Algorithm for Subgraph Isomorphism
- Efficient Planarity Testing
- Approximation algorithms for NP-complete problems on planar graphs
- The complexity of theorem-proving procedures
- Some simplified NP-complete graph problems
- On the complexity of embedding planar graphs to minimize certain distance measures
- Determining the Smallest k Such That G Is k-Outerplanar
- Object Recognition Through Topo-Geometric Shape Models Using Error-Tolerant Subgraph Isomorphisms
Cited In (1)
Recommendations
- Approximation algorithms for NP-complete problems on planar graphs ๐ ๐
- On the hardness of approximating minimum vertex cover ๐ ๐
- An approximation of the minimum vertex cover in a graph ๐ ๐
- Approximation Algorithm for the Minimum Connected $$k$$-Path Vertex Cover Problem ๐ ๐
- A graph approximation heuristic for the vertex cover problem on planar graphs ๐ ๐
- On the Complexity of Planar Covering of Small Graphs ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
This page was built for publication: Approximating the minimum hub cover problem on planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963689)
