Publication Details
Title: A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number
Author: T. Tantau
Group: Algorithms
Date: January 5, 2004
PDF: [Not available online]
Bibliographic Information:
Proceedings of STACS 2004, Lecture Notes on Computer Science, Springer-Verlag
Bibliographic Reference:
T. Tantau. A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number. Proceedings of STACS 2004, Lecture Notes on Computer Science, Springer-Verlag, January 5, 2004
Author: T. Tantau
Group: Algorithms
Date: January 5, 2004
PDF: [Not available online]
Bibliographic Information:
Proceedings of STACS 2004, Lecture Notes on Computer Science, Springer-Verlag
Bibliographic Reference:
T. Tantau. A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number. Proceedings of STACS 2004, Lecture Notes on Computer Science, Springer-Verlag, January 5, 2004