On approximating the longest path in a graph
type: Item
instance of: scholarly article
title: On approximating the longest path in a graph
zbMATH Open document ID: 0876.68083
DOI: 10.1007/BF02523689
author: G. D. S. Ramkumar
author: David R. Karger
author: Rajeev Motwani
published in: Algorithmica
publication date: 1997-11-12T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 1002568
zbMATH Keywords: undirected graphs
zbMATH Keywords: greedy algorithm
MaRDI profile type: Publication
Wikidata QID: Q56639263
cites work: Q4230322
cites work: Q4230321
cites work: On the complexity of approximating the independent set problem
cites work: Finding hidden hamiltonian cycles
cites work: Tough graphs and Hamiltonian circuits.
cites work: Edmonds polytopes and weakly hamiltonian graphs
cites work: Q4058132
cites work: Bin packing can be solved within 1+epsilon in linear time
cites work: Q4763417
cites work: Q4198056
cites work: The NP-completeness column: An ongoing guide
cites work: Approximate graph coloring by semidefinite programming
cites work: On the hardness of approximating minimization problems
cites work: The Traveling Salesman Problem with Distances One and Two
DBLP publication ID: journals/algorithmica/KargerMR97
Recommended article: On approximating the longest path in a graph
Recommended article: Approximating the longest paths in grid graphs
Recommended article: Approximating Shortest Paths in Graphs
Recommended article: Automata, Languages and Programming
Recommended article: An approximation algorithm for computing longest paths.
Recommended article: Q4952685
Recommended article: An approximation algorithm for finding long paths in Hamiltonian graphs
Recommended article: Algorithms for long paths in graphs
Recommended article: ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES
Recommended article: Bounding the distance among longest paths in a connected graph
description: scientific article; zbMATH DE number 1002568