-
4
-
-
2442595239
-
From dynamic programming to greedy algorithms
-
B. Möller, H. Partsch, S. Schuman (Eds.)
-
R.S. Bird, O. de Moor, From dynamic programming to greedy algorithms, in: B. Möller, H. Partsch, S. Schuman (Eds.), Formal Program Development, Lecture Notes in Computer Science, Vol. 755, 1993, pp. 43-61.
-
(1993)
Lecture Notes in Computer Science
, vol.755
, pp. 43-61
-
-
Bird, R.S.1
De Moor, O.2
-
7
-
-
0016973707
-
Canonical coin changing and greedy solutions
-
Chang L., Korsh J.F. Canonical coin changing and greedy solutions. J. Assoc. Comput. Machinery. 23(3):1976;418-422.
-
(1976)
J. Assoc. Comput. Machinery
, vol.23
, Issue.3
, pp. 418-422
-
-
Chang, L.1
Korsh, J.F.2
-
8
-
-
0014710188
-
Algorithmic solution of the change-making problem
-
Chang S.K., Gill A. Algorithmic solution of the change-making problem. J. ACM. 17(1):1970;113-122.
-
(1970)
J. ACM
, vol.17
, Issue.1
, pp. 113-122
-
-
Chang, S.K.1
Gill, A.2
-
11
-
-
0242404254
-
-
D.Phil. Thesis, Technical Monograph PRG-122, Oxford University Computing Laboratory
-
S. Curtis, A relational approach to optimization problems, D.Phil. Thesis, Technical Monograph PRG-122, Oxford University Computing Laboratory, 1996.
-
(1996)
A Relational Approach to Optimization Problems
-
-
Curtis, S.1
-
15
-
-
27744567233
-
Matroids and the greedy algorithm
-
Edmonds J. Matroids and the greedy algorithm. Math. Programming. 1:1971;126-136.
-
(1971)
Math. Programming
, vol.1
, pp. 126-136
-
-
Edmonds, J.1
-
16
-
-
84958049259
-
Greedy algorithms for the shortest common superstring that are asymptotically optimal
-
European Symp. on Algorithms, Springer, Berlin
-
A.M. Frieze, W. Szpankowski, Greedy algorithms for the shortest common superstring that are asymptotically optimal, in: European Symp. on Algorithms, Lecture Notes in Computer Science, Vol. 1136, Springer, Berlin, 1996, pp. 194-207.
-
(1996)
Lecture Notes in Computer Science
, vol.1136
, pp. 194-207
-
-
Frieze, A.M.1
Szpankowski, W.2
-
17
-
-
85027608700
-
Approximating polygons and subdivisions with minimum link paths
-
formerly SIGAL International Symposium on Algorithms, Organized by Special Interest Group on Algorithms (SIGAL) of the Information Processing Society of Japan (IPSJ) and the Technical Group on Theoretical Foundation of Computing of the Institute of Electronics, Information and Communication Engineers (IEICE)
-
L.J. Guibas, J.E. Hershberger, J.S.B. Mitchell, J.S. Snoeyink, Approximating polygons and subdivisions with minimum link paths, in: ISAAC: 2nd Internat. Symp. on Algorithms and Computation (formerly SIGAL International Symposium on Algorithms), Organized by Special Interest Group on Algorithms (SIGAL) of the Information Processing Society of Japan (IPSJ) and the Technical Group on Theoretical Foundation of Computing of the Institute of Electronics, Information and Communication Engineers (IEICE), 1991.
-
(1991)
ISAAC: 2nd Internat. Symp. on Algorithms and Computation
-
-
Guibas, L.J.1
Hershberger, J.E.2
Mitchell, J.S.B.3
Snoeyink, J.S.4
-
18
-
-
0242572710
-
A theory of greedy structures based on k-ary dominance relations
-
Department of Computer Science, University of New Mexico
-
P. Helman, A theory of greedy structures based on k-ary dominance relations, Technical Report CS89-11, Department of Computer Science, University of New Mexico, 1989.
-
(1989)
Technical Report CS89-11
-
-
Helman, P.1
-
19
-
-
0242327610
-
An exact characterization of greedy structures
-
May
-
Helman P., Moret B., Shapiro H. An exact characterization of greedy structures. SIAM J. Discrete Math. 6(2):May 1993;274-283.
-
(1993)
SIAM J. Discrete Math.
, vol.6
, Issue.2
, pp. 274-283
-
-
Helman, P.1
Moret, B.2
Shapiro, H.3
-
20
-
-
0242656072
-
Practical algorithms for online routing on SIMD meshes
-
Department of Computer Science, University of Massachusetts
-
M. Herbordt, J. Corbett, C. Weems, J. Spalding, Practical algorithms for online routing on SIMD meshes, Technical Report UM-CS-1991-063, Department of Computer Science, University of Massachusetts, 1991.
-
(1991)
Technical Report UM-CS-1991-063
-
-
Herbordt, M.1
Corbett, J.2
Weems, C.3
Spalding, J.4
-
21
-
-
0024665938
-
2 n) algorithm for the maximum weighted tardiness problem
-
2 n) algorithm for the maximum weighted tardiness problem Inform. Process. Lett. 31:1989;215-219.
-
(1989)
Inform. Process. Lett.
, vol.31
, pp. 215-219
-
-
Hochbaum, D.S.1
Shamir, R.2
-
23
-
-
84938015047
-
A method for the construction of minimum redundancy codes
-
Huffman D.A. A method for the construction of minimum redundancy codes. Proc. IRE. 40:1952;1098-1101.
-
(1952)
Proc. IRE
, vol.40
, pp. 1098-1101
-
-
Huffman, D.A.1
-
25
-
-
0029197192
-
Combinatorial algorithms for DNA sequence assembly
-
Kececioglu J.D., Myers E.W. Combinatorial algorithms for DNA sequence assembly. Algorithmica. 13(1/2):1995;7-51.
-
(1995)
Algorithmica
, vol.13
, Issue.1-2
, pp. 7-51
-
-
Kececioglu, J.D.1
Myers, E.W.2
-
27
-
-
84987481205
-
Mathematical structures underlying greedy algorithms
-
Fundamentals of Computation Theory, Springer, Berlin
-
B. Korte, L. Lovász, Mathematical structures underlying greedy algorithms, in: Fundamentals of Computation Theory, Lecture Notes in Computer Science, Vol. 117, Springer, Berlin, 1981, pp. 205-209.
-
(1981)
Lecture Notes in Computer Science
, vol.117
, pp. 205-209
-
-
Korte, B.1
Lovász, L.2
-
30
-
-
70350674995
-
On the shortest spanning subtree of a graph and the traveling salesman problem
-
Kruskal J.B. Jr. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc. 7(1):1956;48-50.
-
(1956)
Proc. Amer. Math. Soc.
, vol.7
, Issue.1
, pp. 48-50
-
-
Kruskal Jr., J.B.1
-
31
-
-
0001253255
-
Optimal sequencing of a single machine subject to precedence constraints
-
Lawler E. Optimal sequencing of a single machine subject to precedence constraints. Management Sci. 19(5):1973;544-546.
-
(1973)
Management Sci.
, vol.19
, Issue.5
, pp. 544-546
-
-
Lawler, E.1
-
32
-
-
0001938128
-
Algorithmics - Towards programming as a mathematical activity
-
J.W. de Bakker, M. Hazewinkel, & J.K. Lenstra. Amsterdam: North-Holland
-
Meertens L. Algorithmics - towards programming as a mathematical activity. de Bakker J.W., Hazewinkel M., Lenstra J.K. Mathematics and Computer Science. CWI Monographs. Vol. 1:1986;289-334 North-Holland, Amsterdam.
-
(1986)
Mathematics and Computer Science, CWI Monographs
, vol.1
, pp. 289-334
-
-
Meertens, L.1
-
34
-
-
84911584312
-
Shortest connection networks and some generalizations
-
Prim R.C. Shortest connection networks and some generalizations. Bell System Technical J. 36:1957;1389-1401.
-
(1957)
Bell System Technical J.
, vol.36
, pp. 1389-1401
-
-
Prim, R.C.1
-
35
-
-
0002571721
-
An optimal encoding with minimum longest code and total number of digits
-
Schwartz E.S. An optimal encoding with minimum longest code and total number of digits. Inform. Control. 7(1):1964;37-44.
-
(1964)
Inform. Control
, vol.7
, Issue.1
, pp. 37-44
-
-
Schwartz, E.S.1
-
36
-
-
0015600497
-
Common phrases and minimum-space test storage
-
Wagner R.A. Common phrases and minimum-space test storage. Comm. ACM. 16(3):1973;148-152.
-
(1973)
Comm. ACM
, vol.16
, Issue.3
, pp. 148-152
-
-
Wagner, R.A.1
-
37
-
-
0001587384
-
On the abstract properties of linear dependence
-
Whitney H. On the abstract properties of linear dependence. Amer. J. Math. 57:1935;509-533.
-
(1935)
Amer. J. Math.
, vol.57
, pp. 509-533
-
-
Whitney, H.1
|