scientific article; zbMATH DE number 5070513

From MaRDI portal
Publication:5395365

zbMath1100.90001MaRDI QIDQ5395365

No author found.

Publication date: 2 November 2006


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (40)

A combinatorial algorithm for the TDMA message scheduling problemSystem modeling and performance analysis of the power saving class type II in BWA networksMathematical programming approaches for dual multicast routing problem with multilayer risk costExact interdiction models and algorithms for disconnecting networks via node deletionsMin-energy broadcast in mobile ad hoc networks with restricted motionEvaluation performance of genetic algorithm and tabu search algorithm for solving the MAX-RWA problem in all-optical networksAn exact algorithm for a resource allocation problem in mobile wireless communicationsBiased random-key genetic algorithms with applications in telecommunicationsAn integer programming framework for critical elements detection in graphsSolving Steiner trees: Recent advances, challenges, and perspectivesRevisiting wireless network jamming by SIR-based considerations and multiband robust optimizationThe wireless network jamming problemA linear time approximation scheme for computing geometric maximum \(k\)-starPerformance analysis and evaluation of an enhanced power saving class type III in IEEE 802.16 with self-similar trafficTopology design for on-demand dual-path routing in wireless networksSufficient conditions for protection routing in IP networksOptimal Network Design with End-to-End Service RequirementsMixed-integer nonlinear programs featuring ``on/off constraintsData transfer planning with tree placement for collaborative environmentsApproximate dynamic programming for link scheduling in wireless mesh networksBi-perspective functions for mixed-integer fractional programs with indicator variablesJamming communication networks under complete uncertaintyA two-level graph partitioning problem arising in mobile wireless communicationsFinancial networks with intermediation and transportation network equilibria: A supernetwork equivalence and reinterpretation of the equilibrium conditions with computationsThe internet, evolutionary variational inequalities, and the time-dependent Braess paradoxPolynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphsA cooperative differential game model based on network throughput and energy efficiency in wireless networksCapacity optimization through sensing threshold adaptation for cognitive radio networksFast heuristics for the Steiner tree problem with revenues, budget and hop constraintsMaximum information stored in a labeled connected network with minimum edgesModels and complexity of problems of design and reconstruction of telecommunication and transport systemsRedundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithmsThe M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPsReformulations and solution algorithms for the maximum leaf spanning tree problemTowards optimizing the deployment of optical access networksComplexity of a classical flow restoration problemDetecting critical nodes in sparse graphsComputing a Minimum-Cost k-Hop Steiner Tree in Tree-Like MetricsGraphs and Algorithms in Communication Networks on Seven League BootsOptimal-constrained multicast sub-graph over coded packet networks




This page was built for publication: