Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem.

Artur Czumaj Andrzej Lingas Hairong Zhao

Published in: ICALP (2002)

Keyphrases

network design problem
approximation algorithms
approximation schemes
np hard
special case
worst case
np complete
primal dual
image processing
reinforcement learning