scientific article; zbMATH DE number 6783447

zbMath1376.68167MaRDI QIDQ5365095

Ankur Moitra, Matthew T. Andrews, Howard J. Karloff, Mohammad Taghi Hajiaghayi

Publication date: 29 September 2017

Full work available at URL: http://dl.acm.org/citation.cfm?id=2133112

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Optimal cuts and partitions in tree metrics in polynomial time

This page was built for publication: