Session 2A-Approximation Algorithms-A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees [Book Review]

In O. Stock & M. Schaerf (eds.), Lecture Notes in Computer Science. Springer Verlag. pp. 100-110 (2006)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Nonlocality and the Rotating Wave Approximation.A. A. Clerk & J. E. Sipe - 1998 - Foundations of Physics 28 (4):639-651.
Approximation Representations for Δ2 Reals.George Barmpalias - 2004 - Archive for Mathematical Logic 43 (8):947-964.
Invitation to fixed-parameter algorithms.Rolf Niedermeier - 2006 - New York: Oxford University Press.
Towards an Expanded Epistemology for Approximations.Jeffry L. Ramsey - 1992 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1992:154 - 164.
On the Computational Complexity of Best L1-approximation.Paulo Oliva - 2002 - Mathematical Logic Quarterly 48 (S1):66-77.
Truth approximation via abductive belief change.Gustavo Cevolani - 2013 - Logic Journal of the IGPL 21 (6):999-1016.

Analytics

Added to PP
2014-01-28

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references