On the longest circuit in an alterable digraph
type: Item
instance of: scholarly article
title: On the longest circuit in an alterable digraph
zbMATH Open document ID: 0839.90134
DOI: 10.1007/BF01279452
author: Chih-Long Lin
author: Ker-I Ko
published in: Journal of Global Optimization
publication date: 1996-02-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 829913
zbMATH Keywords: approximation
zbMATH Keywords: NP-hardness
zbMATH Keywords: alterable digraph
zbMATH Keywords: global optimization
MaRDI profile type: Publication
cites work: Q4230322
cites work: Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions
cites work: Q4198056
cites work: On the hardness of approximating minimization problems
cites work: Optimization, approximation, and complexity classes
cites work: The Traveling Salesman Problem with Distances One and Two
cites work: The polynomial-time hierarchy
full work available at URL: https://doi.org/10.1007/bf01279452
OpenAlex ID: W2046896701
description: scientific article; zbMATH DE number 829913