The following pages link to (Q5395365):
Displaying 40 items.
- An integer programming framework for critical elements detection in graphs (Q405684) (← links)
- Performance analysis and evaluation of an enhanced power saving class type III in IEEE 802.16 with self-similar traffic (Q421289) (← links)
- Mixed-integer nonlinear programs featuring ``on/off'' constraints (Q453616) (← links)
- Maximum information stored in a labeled connected network with minimum edges (Q548186) (← links)
- Data transfer planning with tree placement for collaborative environments (Q647480) (← links)
- A cooperative differential game model based on network throughput and energy efficiency in wireless networks (Q691411) (← links)
- Capacity optimization through sensing threshold adaptation for cognitive radio networks (Q694188) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- A combinatorial algorithm for the TDMA message scheduling problem (Q839680) (← links)
- Evaluation performance of genetic algorithm and tabu search algorithm for solving the MAX-RWA problem in all-optical networks (Q887850) (← links)
- Revisiting wireless network jamming by SIR-based considerations and multiband robust optimization (Q895758) (← links)
- Approximate dynamic programming for link scheduling in wireless mesh networks (Q925829) (← links)
- Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms (Q976036) (← links)
- Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702) (← links)
- Detecting critical nodes in sparse graphs (Q1013394) (← links)
- An exact algorithm for a resource allocation problem in mobile wireless communications (Q1687306) (← links)
- A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
- Exact interdiction models and algorithms for disconnecting networks via node deletions (Q1926497) (← links)
- Min-energy broadcast in mobile ad hoc networks with restricted motion (Q1928494) (← links)
- Biased random-key genetic algorithms with applications in telecommunications (Q1935883) (← links)
- A linear time approximation scheme for computing geometric maximum \(k\)-star (Q1942028) (← links)
- Topology design for on-demand dual-path routing in wireless networks (Q1947619) (← links)
- Sufficient conditions for protection routing in IP networks (Q1947622) (← links)
- Bi-perspective functions for mixed-integer fractional programs with indicator variables (Q2235139) (← links)
- Models and complexity of problems of design and reconstruction of telecommunication and transport systems (Q2263339) (← links)
- Optimal-constrained multicast sub-graph over coded packet networks (Q2343995) (← links)
- System modeling and performance analysis of the power saving class type II in BWA networks (Q2393077) (← links)
- Mathematical programming approaches for dual multicast routing problem with multilayer risk cost (Q2393468) (← links)
- The wireless network jamming problem (Q2426656) (← links)
- Jamming communication networks under complete uncertainty (Q2465566) (← links)
- Financial networks with intermediation and transportation network equilibria: A supernetwork equivalence and reinterpretation of the equilibrium conditions with computations (Q2468330) (← links)
- The internet, evolutionary variational inequalities, and the time-dependent Braess paradox (Q2468772) (← links)
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints (Q2482819) (← links)
- Towards optimizing the deployment of optical access networks (Q2513732) (← links)
- Complexity of a classical flow restoration problem (Q2811305) (← links)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
- Optimal Network Design with End-to-End Service Requirements (Q4604906) (← links)
- Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs (Q4648696) (← links)
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
