English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  A Generalization of Janson inequalities and its application to finding shortest paths

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.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-358F-C Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3590-6
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Subramanian, C. R.1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021999
 Publication Status: Issued
 Pages: -
 Publishing info: New York, USA : ACM
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 518061
Other: Local-ID: C1256428004B93B8-2BE1405545CB1E0DC12568AC0058EFD7-crsoda99
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Baltimore, USA
Start-/End Date: 1999

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, USA : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 795 - 804 Identifier: -