If you are experiencing problems downloading PDF or HTML fulltext, our helpdesk recommend clearing your browser cache and trying again. If you need help in clearing your cache, please click here . Still need help? Email help@ingentaconnect.com

Publisher: Elsevier

Related content
Volume 67, Number 5, 15 September 1998

< previous issue | all issues | next issue >

Favourites:Add to Favourites

On syntactic nuclei of rational languages
pp. 221-226(6)
Authors: Edwards, K.J.; Valley, J.W.; Amiri, A.; Vafai, K.; Huaxiong, W.

Favourites:Add to Favourites

Breaking symmetry in complete graphs by orienting edges: asymptotic bounds
pp. 227-230(4)
Authors: Hsu, W.; Crozaz, G.; Harary, F.; Ranjan, D.

Favourites:Add to Favourites

On the traveling salesman problem with a relaxed Monge matrix
pp. 231-237(7)
Authors: Eggleston, C.M.; Jordan, G.; Lan, C.W.; Yang, D.T.; Burkard, R.E.; deineko, V.G.

Favourites:Add to Favourites

A note on minimizing submodular functions
pp. 239-244(6)
Authors: Fricke, H.C.; Clyde, W.C.; O'Neil, J.R.; Zanchini, E.; Nagamochi, H.; Ibaraki, T.

Favourites:Add to Favourites

Root-neededness and approximations of neededness
pp. 245-254(10)
Authors: Miura, Y.N.; Nagao2, K.; Sugiura, N.; Fujitani, T.; Warren, P.H.; Lucas, S.

Favourites:Add to Favourites

An O(n3) time algorithm for recognizing threshold dimension 2 graphs
pp. 255-259(5)
Authors: Sinclair, D.J.; Kinsley, L.P.J.; McCulloch, M.T.; Watel, B.; Harmand, S.; desmet, B.; Sterbini, A.; Raschle, T.

Favourites:Add to Favourites

An approximate binary search algorithm for the multiple-choice knapsack problem
pp. 261-265(5)
Authors: Zou, H.; Gens, G.; Levner, E.

Favourites:Add to Favourites

Improved approximation algorithms for embedding hyperedges in a cycle
pp. 267-271(5)
Authors: Kohn, M.J.; Valley, J.W.; Ganzevles, F.L.A.; Geld, C.W.M.v.d.; Gonzalez, T.F.

Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more