Pages that link to "Item:Q5385926"
From MaRDI portal
The following pages link to Combinatorial and Algorithmic Aspects of Networking (Q5385926):
Displayed 20 items.
- Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless Networks (Q5385927) (← links)
- The Price of Anarchy in Selfish Multicast Routing (Q5385929) (← links)
- Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem (Q5385930) (← links)
- On the Topologies of Local Minimum Spanning Trees (Q5385931) (← links)
- Distributed Routing in Tree Networks with Few Landmarks (Q5385932) (← links)
- Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs (Q5385933) (← links)
- On Minimizing the Number of ADMs – Tight Bounds for an Algorithm Without Preprocessing (Q5385934) (← links)
- Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP (Q5385935) (← links)
- Acyclic Type-of-Relationship Problems on the Internet (Q5385936) (← links)
- Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The α≤d Case) (Q5385937) (← links)
- Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks (Q5385938) (← links)
- Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm (Q5458503) (← links)
- Nonadaptive Selfish Routing with Online Demands (Q5458504) (← links)
- Vertex Pursuit Games in Stochastic Network Models (Q5458505) (← links)
- Preemptive Scheduling on Selfish Machines (Q5458506) (← links)
- Selfish Routing and Path Coloring in All-Optical Networks (Q5458507) (← links)
- A Worst-Case Time Upper Bound for Counting the Number of Independent Sets (Q5458508) (← links)
- Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP (Q5458509) (← links)
- Combinatorial Algorithms for Listing Paths in Minimal Change Order (Q5458510) (← links)
- Improving Topological Routing in N2R Networks (Q5458511) (← links)