Computational complexity of the graph approximation problem
From MaRDI portal
Publication:3115581
DOI10.1134/S1990478907010012zbMath1249.68085MaRDI QIDQ3115581
A. S. Televnin, Alexander V. Kononov, A. A. Ageev, Victor Petrovich Il'ev
Publication date: 10 February 2012
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (13)
$2$-Approximation algorithms for two graph clustering problems ⋮ Method of conditional moments (MCM) for the chemical master equation ⋮ Graph clustering with a constraint on cluster sizes ⋮ On facet-inducing inequalities for combinatorial polytopes ⋮ Unnamed Item ⋮ On a semi-superwized graph clustering problem ⋮ APPROXIMATE ALGORITHMS FOR GRAPH CLUSTERING PROBLEM ⋮ ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM ⋮ Estimation of discontinuous functions of two variables with unknown discontinuity lines (rectangular elements) ⋮ Approximation algorithms for graph approximation problems ⋮ The Branch and Cut Method for the Clique Partitioning Problem ⋮ Unnamed Item ⋮ The generic complexity of the bounded problem of graphs clustering
This page was built for publication: Computational complexity of the graph approximation problem
