Journal of Combinatorial Optimization logo Springer logo

Publisher: Springer

Related content
Volume 4, Number 2, June 2000

< previous issue | all issues | next issue >

A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs
pp. 151-169(19)
Authors: Nagamochi H.; Katayama S.; Ibaraki T.

Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions
pp. 171-186(16)
Authors: Dawande M.; Kalagnanam J.; Keskinocak P.; Salman F.S.; Ravi R.

On the Complexity of the Steiner Problem
pp. 187-195(9)
Authors: Brazil M.; Thomas D.A.; Weng J.F.

A Semidefinite Programming Approach to the Quadratic Knapsack Problem
pp. 197-215(19)
Authors: Helmberg C.; Rendl F.; Weismantel R.

An Efficient Algorithm for Delay Buffer Minimization
pp. 217-233(17)
Authors: Xue G.; Sun S.; Du D.H.C.; Shi L.

Combining Linear and Non-Linear Objectives in Spanning Tree Problems
pp. 253-269(17)
Authors: Dell'Amico M.; Maffioli F.

A 75° Angle Constraint for Plane Minimal T1 Trees
pp. 271-284(14)
Author: Cole T.

< previous issue | all issues | next issue >

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

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page