Approximation algorithms for graph approximation problems

DOI10.1134/S1990478911040120zbMath1459.05315OpenAlexW1984189014MaRDI QIDQ4691776

Svetlana Il'eva, Victor Petrovich Il'ev

Publication date: 24 October 2018

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/timb6

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)

Related Items (1)

A PTAS for the Cluster Editing Problem on Planar Graphs

Cites Work

• La reduction minimale d'un graphe à une reunion de cliques
• Computational complexity of the graph approximation problem
• Approximating Symmetric Relations by Equivalence Relations
• Paths, Trees, and Flowers
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximation algorithms for graph approximation problems