2 polylog n) Time.">2 polylog n) Time., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

More Web Proxy on the site http://driver.im/

default search action

combined dblp search
author search
venue search
publication search

ask others

"All-Pairs Nearly 2-Approximate Shortest-Paths in O(n2 polylog ..."

Surender Baswana, Vishrut Goyal, Sandeep Sen (2005)

> Home

Details and statistics

DOI: 10.1007/978-3-540-31856-9_55

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stacs/BaswanaGS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/BaswanaGS05
Surender Baswana, Vishrut Goyal, Sandeep Sen:
All-Pairs Nearly 2-Approximate Shortest-Paths in O(n² polylog n) Time. STACS 2005: 666-679

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.