Polynomial-Time Computable Backup Tables for Shortest-Path Routing.

Hiro Ito Kazuo Iwama Yasuo Okabe Takuya Yoshihiro

Published in: SIROCCO (2003)

Keyphrases

finite sets
turing machine
special case
database
computational complexity
approximation algorithms
worst case
high availability
databases
learning algorithm
np hard
bitstream
materialized views