5595 search results - page 44 / 1119 » Approximation Algorithms for Clustering Problems |
154
Voted
ALGOSENSORS
2009
Springer
15 years 9 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...
195
Voted
SIAMSC
2011
14 years 9 months ago
2011
We consider the problem of estimating the uncertainty in large-scale linear statistical inverse problems with high-dimensional parameter spaces within the framework of Bayesian inf...
148
click to vote
WINE
2010
Springer
15 years 13 days ago
2010
Springer
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
118
Voted
EOR
2006
15 years 2 months ago
2006
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
131
Voted
JCO
2007
15 years 2 months ago
2007
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...