Approximation Algorithms for Edge-Covering Problem

DOI10.1007/978-3-540-89985-3_136zbMath1183.68747OpenAlexW1490723766MaRDI QIDQ3628568

Alireza Bagheri, Mohammad Hosseinzadeh Moghaddam

Publication date: 20 May 2009

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89985-3_136

zbMATH Keywords

approximation algorithmart galleryedge-coveringedge guardvertex guard

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items (1)

A mixed integer linear program and tabu search approach for the complementary edge covering problem

Cites Work

• Unnamed Item
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Approximation algorithms for combinatorial problems
• A linear algorithm for computing the visibility polygon from a point

This page was built for publication: Approximation Algorithms for Edge-Covering Problem