About fully Polynomial Approximability of the Generalized Knapsack Problem
![]() |
홍성필
(중앙대학교 사회과학대학 상경학부)
박범환 (서울대학교 대학원 산업공학과) |
1 |
/
|
2 |
/
|
3 |
The Constrained Minimum Spanning Tree Problem
/
|
4 |
Determinant : Old Algorithms, New Insights
/
|
5 |
Bicriteria Network Design Problems
/
ScienceOn |
6 |
Matrix Tree theorem
/
|
7 |
Approximation Schemes for The Restricted Shortest Path Problem
/
|
8 |
Fast Approximation Algorithms for the Knapsack and Sum of Subsets Problems
/
|
9 |
Minimal Spanning Tree Subject to a Side Constraints
/
ScienceOn |
10 |
A Fully Polynamial Bicriteria Approximation Scheme for Constrained Spanning tree Problem
/
|
11 |
Exact Arborescences, Matchings and Cycles
/
|
12 |
Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
/
ScienceOn |
![]() |