English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Approximate Minimum Directed Spanning Trees Under Congestion

Lenzen, C., & Vahidi, H. (2021). Approximate Minimum Directed Spanning Trees Under Congestion. In T. Jurdziński, & S. Schmid (Eds.), Structural Information and Communication Complexity (pp. 352-369). Berlin: Springer. doi:10.1007/978-3-030-79527-6_20.

Item is

Basic

show hide
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Lenzen, Christoph1, Author           
Vahidi, Hossein1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20212021
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Lenzen_SIROCCO21
DOI: 10.1007/978-3-030-79527-6_20
 Degree: -

Event

show
hide
Title: 28th International Colloquium on Structural Information and Communication Complexity
Place of Event: Wrocław, Poland (Online)
Start-/End Date: 2021-06-28 - 2021-07-01

Legal Case

show

Project information

show

Source 1

show
hide
Title: Structural Information and Communication Complexity
  Subtitle : 28th International Colloquium, SIROCCO 2021 ; Wrocław, Poland, June 28 – July 1, 2021 ; Proceedings
  Abbreviation : SIROCCO 2021
Source Genre: Proceedings
 Creator(s):
Jurdziński, Tomasz1, Editor
Schmid, Stefan1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 352 - 369 Identifier: ISBN: 978-3-030-79526-9

Source 2

show
hide
Title: Lecture Notes in Computer Science
  Abbreviation : LNCS
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 12810 Sequence Number: - Start / End Page: - Identifier: -