-
2
-
-
84968329707
-
Blindly competitive algorithms for pricing and bidding
-
B. Awerbuch and Y. Azar. Blindly competitive algorithms for pricing and bidding. Manuscript.
-
Manuscript
-
-
Awerbuch, B.1
Azar, Y.2
-
4
-
-
0028196392
-
Competitive non-preemptive callcontrol
-
B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosen. Competitive non-preemptive callcontrol. In Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 23-25 Jan 1994.
-
(1994)
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
, vol.Jan
, pp. 23-25
-
-
Awerbuch, B.1
Bartal, Y.2
Fiat, A.3
Rosen, A.4
-
5
-
-
84958098913
-
-
Technical report, IBM India Research Lab
-
A. Bagchi, A. Chaudhary, R. Garg, M. T. Goodrich, and V. Kumar. Online algorithms for auctioning problems. Technical report, IBM India Research Lab, 2000.
-
(2000)
Online Algorithms for Auctioning Problems
-
-
Bagchi, A.1
Chaudhary, A.2
Garg, R.3
Goodrich, M.T.4
Kumar, V.5
-
6
-
-
0028254345
-
A new measure for the study of on-line algorithms
-
S. Ben-David and A. Borodin. A new measure for the study of on-line algorithms. Algorithmica, 11:73–91, 1994.
-
(1994)
Algorithmica
, vol.11
, pp. 73-91
-
-
Ben-David, S.1
Borodin, A.2
-
9
-
-
23944476294
-
-
editors, New York University Press
-
R. Engelbrecht-Wiggans, M. Shubik, and R. M. Stark, editors. Auctions, Bidding, and Contracting: Uses and Theory. New York University Press, 1983.
-
(1983)
Auctions, Bidding, and Contracting: Uses and Theory
-
-
Engelbrecht-Wiggans, R.1
Shubik, M.2
Stark, R.M.3
-
12
-
-
0016560084
-
Fast approximation algorithms for the knapsack and subset sum problems
-
O. H. Ibarra and C. E. Kim. Fast approximation algorithms for the knapsack and subset sum problems. Journal of the ACM, 22:463–468, 1975.
-
(1975)
Journal of the ACM
, vol.22
, pp. 463-468
-
-
Ibarra, O.H.1
Kim, C.E.2
-
16
-
-
0012834885
-
Average-case analysis of off-line and on-line knapsack problems
-
November
-
G. Lueker. Average-case analysis of off-line and on-line knapsack problems. Journal of Algorithms, 29(2):277–305, November 1998.
-
(1998)
Journal of Algorithms
, vol.29
, Issue.2
, pp. 277-305
-
-
Lueker, G.1
-
19
-
-
0032141895
-
Computationally manageable combinatorial auctions
-
M. H. Rothkopf, A Pekec, and R. M. Harstad. Computationally manageable combinatorial auctions. Management Science, 44(8):1131–1147, 1998.
-
(1998)
Management Science
, vol.44
, Issue.8
, pp. 1131-1147
-
-
Rothkopf, M.H.1
Pekec, A.2
Harstad, R.M.3
-
20
-
-
0016437461
-
Approximation algorithms for the 0/1 knapsack problem
-
S. Sahni. Approximation algorithms for the 0/1 knapsack problem. Journal of the ACM, 22:115–124, 1975.
-
(1975)
Journal of the ACM
, vol.22
, pp. 115-124
-
-
Sahni, S.1
-
25
-
-
0032398304
-
Competitive analysis of on-line disk scheduling
-
T. Yeh, C. Kuo, C. Lei, and H. Yen. Competitive analysis of on-line disk scheduling. Theory of Computing Systems, 31:491–506, 1998.
-
(1998)
Theory of Computing Systems
, vol.31
, pp. 491-506
-
-
Yeh, T.1
Kuo, C.2
Lei, C.3
Yen, H.4
|