Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs.

Andrzej Lingas Eva-Marta Lundell

Published in: LATIN (2008)

Keyphrases

approximation algorithms
undirected graph
np hard
special case
minimum cost
vertex cover
worst case
disjoint paths
open shop
approximation ratio
shortest path
primal dual
constant factor
graphical models
markov chain
precedence constraints
probabilistic model
exact inference
polynomial time approximation