Approximating the minimum hub cover problem on planar graphs

DOI10.1007/s11590-015-0876-5zbMath1339.90292OpenAlexW2133597921MaRDI QIDQ5963689

Ş. İ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

zbMATH Keywords

approximation algorithmminimum hub cover problemplanar graph decompositionquery processingsubgraph isomorphism

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

A fast approximation algorithm for the maximum 2-packing set problem on planar graphs

Cites Work

• On the complexity of embedding planar graphs to minimize certain distance measures
• Some simplified NP-complete graph problems
• Determining the Smallest k Such That G Is k-Outerplanar
• Efficient Planarity Testing
• An Algorithm for Subgraph Isomorphism
• Approximation algorithms for NP-complete problems on planar graphs
• Object Recognition Through Topo-Geometric Shape Models Using Error-Tolerant Subgraph Isomorphisms
• The complexity of theorem-proving procedures

This page was built for publication: Approximating the minimum hub cover problem on planar graphs