224 search results - page 26 / 45 » G-graphs for the cage problem: a new upper bound |
163
click to vote
SOFSEM
2007
Springer
16 years 6 days ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
148
click to vote
IJCGA
2006
15 years 6 months ago
2006
This paper introduces a new notion related to the traveling salesperson problem (TSP) -the notion of the TSP ratio. The TSP ratio of a TSP instance I is the sum of the marginal va...
148
click to vote
ICTCS
2005
Springer
15 years 11 months ago
2005
Springer
We consider the fundamental problem of waking up n processors sharing a multiple access channel. We assume the weakest model of synchronization, the locally synchronous model, in ...
213
click to vote
MOR
2007
15 years 5 months ago
2007
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
166
click to vote
SIAMJO
2002
15 years 5 months ago
2002
In this paper we propose a novel finite-horizon, discrete-time, time-varying filtering method based on the robust semidefinite programming (SDP) technique. The proposed method prov...