On the longest circuit in an alterable digraph

DOI10.1007/BF01279452zbMath0839.90134OpenAlexW2046896701MaRDI QIDQ1904653

Chih-Long Lin, Ker-I. Ko

Publication date: 1 February 1996

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01279452

zbMATH Keywords

global optimizationapproximationNP-hardnessalterable digraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30)

Related Items (1)

In Memoriam: Ker-I Ko (1950–2018)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization, approximation, and complexity classes
• The polynomial-time hierarchy
• The Traveling Salesman Problem with Distances One and Two
• On the hardness of approximating minimization problems
• Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions

This page was built for publication: On the longest circuit in an alterable digraph