scientific article

From MaRDI portal

Revision as of 21:50, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3115248

Jump to:navigation, search

zbMath1249.05366MaRDI QIDQ3115248

A. A. Navrotskaya, Svetlana Il'eva, Victor Petrovich Il'ev

Publication date: 20 February 2012

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation algorithm performance guarantee graph approximation problem

Mathematics Subject Classification ID

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

Related Items (5)

On the polytope faces of the graph approximation problem ⋮ Graph clustering with a constraint on cluster sizes ⋮ On facet-inducing inequalities for combinatorial polytopes ⋮ On a semi-superwized graph clustering problem ⋮ APPROXIMATE ALGORITHMS FOR GRAPH CLUSTERING PROBLEM

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3115248&oldid=16191381"