Skip to main content

Publisher: Elsevier

Volume 65, Number 3, 13 February 1998

A 2.5-factor approximation algorithm for the k-MST problem
pp. 117-118(2)
Authors: Mhimid, A.; Arya, S.; Ramesh, H.

Favourites:
ADD

The NPO-completeness of the longest Hamiltonian cycle problem
pp. 119-123(5)
Authors: Bau, H.H.; Wu, Q.S.; Chao, K.M.; Lee, R.C.T.

Favourites:
ADD

Agreement under faulty interfaces
pp. 125-129(5)
Author: Dasgupta, P.

Favourites:
ADD

The p-neighbor k-center problem
pp. 131-134(4)
Authors: Ho, C.J.; Tu, F.J.; Chaudhuri, S.; Garg, N.; Ravi, R.

Favourites:
ADD

ANSV problem on BSRs
pp. 135-138(4)
Authors: Brown, J.; Vardy, A.; Zhaoyang, Z.; Xiang, L.; Ushijima, K.

Favourites:
ADD

Global avalanche characteristics and nonlinearity of balanced Boolean functions
pp. 139-144(6)
Authors: Geer, J.; Fillo, J.; Jung, J.S.; Jong, I.L.; Seongtaek, C.; Soo, H.S.

Favourites:
ADD

Approximate Max k-Cut with subgraph guarantee
pp. 145-150(6)
Authors: Kann, V.; Lagergren, J.; Panconesi, A.

Favourites:
ADD

Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP
pp. 151-156(6)
Authors: Helgeson, H.C.; Owens, C.E.; Knox, A.M.; Richard, L.; Storesletten, L.; Rees, D.A.S.; Hemaspaandra, E.; Rothe, J.

Favourites:
ADD

Optimal 1-hamiltonian graphs
pp. 157-161(5)
Authors: Nair, S.; Verma, S.; Dhingra, S.C.; Wang, J.; Hung, C.; Hsu L.-H.

Favourites:
ADD

An improved fixed-parameter algorithm for vertex cover
pp. 163-168(6)
Authors: Balasubramanian, R.; Fellows, M.R.; Raman, V.

Favourites:
ADD

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