523 search results - page 86 / 105 » Improved Approximation Algorithms for Maximum Graph Partitio... |
145
click to vote
SIGECOM
2009
ACM
15 years 11 months ago
2009
ACM
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
154
Voted
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Received signal strength (RSS)-based single source localization when there is not a prior knowledge about the transmit power of the source is investigated. Because of nonconvex be...
166
click to vote
ALGORITHMICA
2011
15 years 11 hour ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
378
click to vote
COCOON
2011
Springer
14 years 4 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
148
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequencydivision multi...