Back to Results
First PageMeta Content
Operations research / Network theory / Network flow / Shortest path problem / Bellman–Ford algorithm / Tree / Graph / Flow network / Tree decomposition / Graph theory / Mathematics / Theoretical computer science


J Glob Optim DOI[removed]s10898[removed]Optimal placement of UV-based communications relay nodes Oleg Burdakov · Patrick Doherty · Kaj Holmberg ·
Add to Reading List

Document Date: 2012-01-20 06:09:28

Open Document

File Size: 430,17 KB

Share Result on Facebook

Company

Springer Science+Business Media LLC / Ford / /

Country

Sweden / /

/

Facility

terminal UV / Linköping University / /

IndustryTerm

trivial solution / cheapest path solution / label correcting algorithms / communication equipment / breadth-first search / est path algorithms / communications relays / computational algorithms / base station communications equipment / /

Organization

P.-M. Olsson Department of Computer and Information Science / K. Holmberg Department of Mathematics / Linköping University / /

Person

Patrick Doherty / Oleg Burdakov / /

ProgrammingLanguage

J / /

TVStation

Kaj / /

Technology

label correcting algorithms / two label correcting algorithms / set A. est path algorithms / existing algorithms / /

SocialTag