Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Activities
Research Labs / Equipment
Datasets
Projects
Search by expertise, name or affiliation
Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones
Michael Elkin
, Shay Solomon
Department of Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
15
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Computer Science
Distributed Computing
100%
Minimum Spanning Tree
50%
Constant Factor
50%
Wireless Networks
50%
Sensor Networks
50%
Spanning Tree
50%
Gathering Data
50%
Overlay Network
50%
Message Passing
50%
Designated Vertex
50%
Network Design
50%
Shortest Path Tree
50%
Keyphrases
Shallow-light Trees
100%
Tight
22%
Spanners
22%
Distributed Computing
22%
Network Design
11%
Steiner Point
11%
Minimum Spanning Tree
11%
Wireless Networks
11%
Peleg
11%
Sensor Networks
11%
Spanning Tree
11%
Overlay Networks
11%
Graph Structure
11%
Efficient Broadcast
11%
Shortest-path Tree
11%
Message Passing Model
11%
Exponential Separation
11%
Discrete Algorithm
11%
VLSI Circuit Design
11%