Approximate counting of approximate solutions

Submitted by ethz on Thu, 2013-04-18 16:19
Authors: 
Matúš Mihalák, Rastislav Šrámek, and Peter Widmayer
Publication Date: 
December, 2016
Abstract: 

 We present a fully polynomial-time approximation schemefor counting paths shorter than some threshold on a directed, acyclicgraph.

File: 
ECOMPASS-TR-016.pdf
Work Packages: 
WP2

Latest blog news

User login

Project type: Small or medium-scale focused research project (STREP)
Funding scheme: Collaborative project
Start date: 01 November 2011
Duration: 36 months
The eCOMPASS project is funded by the European Commission, DG CONNECT (Communications Networks, Content and Technology Directorate General), Unit H5 - Smart Cities & Sustainability, under the FP7 Programme.