2957 search results - page 180 / 592 » The Complexity of Polynomial-Time Approximation |
177
Voted
ISAAC
2009
Springer
16 years 21 days ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
170
Voted
MONET
2006
15 years 6 months ago
2006
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...
162
click to vote
AI
2011
Springer
15 years 1 months ago
2011
Springer
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as a bargaining chip to induce other parties interested in the charity to donate ...
194
Voted
WWW
2011
ACM
15 years 1 months ago
2011
ACM
Auctions are widely used on the Web. Applications range from internet advertising to platforms such as eBay. In most of these applications the auctions in use are single/multi-ite...
209
click to vote
COMGEO
2012
ACM
14 years 1 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...