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="Averbakh, Igor"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minisum multipurpose trip location problem on trees
Mojtaba Araghi
,
Oded Berman
,
Igor Averbakh
Networks
63
(2), 2014, pp. 154-159
Cooperative covering problems on networks
Igor Averbakh
,
Oded Berman
,
Dmitry Krass
,
Jörg Kalcsics
,
Stefan Nickel
Networks
63
(4), 2014, pp. 334-349
An improved algorithm for the minmax regret median problem on a tree
Igor Averbakh
,
Oded Berman
Networks
41
(2), 2003, pp. 97-103
Parallel
NC
-algorithms for multifacility location problems with mutual communication and their applications
Igor Averbakh
,
Oded Berman
Networks
40
(1), 2002, pp. 1-12
Location problems with grouped structure of demand: Complexity and algorithms
Igor Averbakh
,
Oded Berman
Networks
31
(2), 1998, pp. 81-92
(p-1)/(p+1)
-approximate algorithms for
p
-traveling salesmen problems on a tree with minmax objective
Igor Averbakh
,
Oded Berman
Discrete Applied Mathematics
75
(3), 1997, pp. 201-216
A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
Igor Averbakh
,
Oded Berman
Discrete Applied Mathematics
68
(1-2), 1996, pp. 17-32
Constrained matroidal bottleneck problems
Igor Averbakh
,
Oded Berman
,
Abraham P. Punnen
Discrete Applied Mathematics
63
, 1995, pp. 201-214
Sales-Delivery Man problems on treelike networks
Igor Averbakh
,
Oded Berman
Networks
25
(2), 1995, pp. 45-58