5889 search results - page 382 / 1178 » Graph Layout Problems |
220
click to vote
GLOBECOM
2010
IEEE
15 years 5 months ago
2010
IEEE
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequency-division mult...
209
click to vote
STACS
2005
Springer
16 years 28 days ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
227
Voted
CPAIOR
2010
Springer
16 years 8 days ago
2010
Springer
Abstract. We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associat...
338
click to vote
NLP
2000
15 years 11 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
236
click to vote
ALGOSENSORS
2009
Springer
16 years 2 months ago
2009
Springer
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...