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
Hilfe
Suche: Author="Kalantari, B."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A general class of heuristics for minimum weight perfect matching and fast special cases with doubly and triply logarithmic errors
C. ImieliĆska
,
B. Kalantari
Algorithmica
18
(4), 1997, pp. 544-559
Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP
B. Kalantari
,
G.B. Khosrovshahi
Networks
28
(4), 1996, pp. 211-219
A new class of heuristic algorithms for weighted perfect matching
M.D. Grigoriadis
,
B. Kalantari
Journal of the ACM
35
(4), 1988, pp. 769-776
Penalty formulation for zero-one nonlinear programming
B. Kalantari
,
J.B. Rosen
Discrete Applied Mathematics
16
, 1987, pp. 179-182
Karmarkar's algorithm with improved steps
B. Kalantari
Technical Report (LCSR-TR-80), 1987, October
A lower bound to the complexity of Euclidean and rectilinear matching algorithms
M.D. Grigoriadis
,
B. Kalantari
Information Processing Letters
22
(2), 1986, January, pp. 73-76
A lower bound to the complexity of Euclidean matching algorithms
M.D. Grigoriadis
,
B. Kalantari
Technical Report (LCSR-TR-59), 1984, October