Spanning Trees With Edge Conflicts and Wireless Connectivity

ICALP, 2018.

Cited by: 1|Bibtex|Views13|Links
EI

Abstract:

introduce the problem of finding a spanning tree along with a partition of the tree edges into fewest number of feasible sets, where constraints on the edges define feasibility. The motivation comes from wireless networking, where we seek to model the irregularities seen in actual wireless environments. Not all node pairs may be able to ...More

Code:

Data:

Your rating :
0

 

Tags
Comments