Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Chang, Soo Y."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximation of a batch consolidation problem
Junho Chang
,
Soo Y. Chang
,
Sung-Pil Hong
,
Yun-Hong Min
,
Myoung-Ju Park
Networks
58
(1), 2011, pp. 12-19
Improved bounds for online scheduling with eligibility constraints
Kyungkuk Lim
,
Kangbok Lee
,
Soo Y. Chang
Theoretical Computer Science
412
(39), 2011, pp. 5211-5224
Approximation of the
k
-batch consolidation problem
Sung-Pil Hong
,
Myoung-Ju Park
,
Soo Y. Chang
Theoretical Computer Science
410
(8-10), 2009, pp. 963-967
The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines
Soo Y. Chang
,
Hark-Chin Hwang
Discrete Applied Mathematics
92
(2-3), 1999, pp. 135-147
The steepest descent gravitational method for linear programming
Soo Y. Chang
,
Katta G. Murty
Discrete Applied Mathematics
25
, 1989, pp. 211-239
On
K^{\Delta}
Sung-Jin Chung
,
Katta G. Murty
,
Soo Y. Chang
Discrete Applied Mathematics
15
, 1986, pp. 199-211