A Generalization of Janson inequalities and its application to finding shortest 
paths

Subramanian, C. R.

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

A Generalization of Janson inequalities and its application to finding shortest paths

MPS-Authors

/persons/resource/persons45571

Subramanian, C. R.
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Subramanian, C. R. (1999). A Generalization of Janson inequalities and its application to finding shortest paths. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99) (pp. 795-804). New York, USA: ACM.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-358F-C

Abstract

There is no abstract available