The complexity of restricted spanning tree problems
type: Item
instance of: scholarly article
title: The complexity of restricted spanning tree problems
zbMATH Open document ID: 0478.68068
DOI: 10.1145/322307.322309
author: Mihalis Yannakakis
author: Christos Papadimitriou
published in: Journal of the ACM
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 94C15
zbMATH DE Number: 3752244
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: network problems
zbMATH Keywords: NP-complete
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: matching
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1145/322307.322309
OpenAlex ID: W2079828065
description: scientific article