nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An approximate binary search algorithm for the multiple-choice knapsack problem
|
Gens, George |
|
1998 |
67 |
5 |
p. 261-265 5 p. |
artikel |
2 |
An O(n 3) time algorithm for recognizing threshold dimension 2 graphs
|
Sterbini, Andrea |
|
1998 |
67 |
5 |
p. 255-259 5 p. |
artikel |
3 |
A note on minimizing submodular functions
|
Nagamochi, Hiroshi |
|
1998 |
67 |
5 |
p. 239-244 6 p. |
artikel |
4 |
Breaking symmetry in complete graphs by orienting edges: asymptotic bounds
|
Harary, Frank |
|
1998 |
67 |
5 |
p. 227-230 4 p. |
artikel |
5 |
Improved approximation algorithms for embedding hyperedges in a cycle
|
Gonzalez, Teofilo F. |
|
1998 |
67 |
5 |
p. 267-271 5 p. |
artikel |
6 |
On syntactic nuclei of rational languages
|
Wang, Huaxiong |
|
1998 |
67 |
5 |
p. 221-226 6 p. |
artikel |
7 |
On the traveling salesman problem with a relaxed Monge matrix
|
Burkard, Rainer E. |
|
1998 |
67 |
5 |
p. 231-237 7 p. |
artikel |
8 |
Root-neededness and approximations of neededness
|
Lucas, Salvador |
|
1998 |
67 |
5 |
p. 245-254 10 p. |
artikel |