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="Tamir, Arie"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved algorithms for some competitive location centroid problems on paths, trees and graphs
Avivit Lazar
,
Arie Tamir
Algorithmica
66
(3), 2013, pp. 615-640
Collection depots facility location problems in trees
Robert Benkoczi
,
Binay Bhattacharya
,
Arie Tamir
Networks
53
(1), 2009, pp. 50-62
Optimal algorithms for the path/tree-shaped facility location problems in trees
Binay Bhattacharya
,
Qiaosheng Shi
,
Arie Tamir
Algorithmica
55
(4), 2009, pp. 601-618
Minimax flow tree problems
Hui Chen
,
Ann Campbell
,
Barrett Thomas
,
Arie Tamir
Networks
54
(3), 2009, pp. 117-129
Efficient algorithms for center problems in cactus networks
Boaz Ben-Moshe
,
Binay Bhattacharya
,
Qiaosheng Shi
,
Arie Tamir
Theoretical Computer Science
378
(3), 2007, pp. 237-252
New results on minimax regret single facility ordered median location problems on networks
Justo Puerto
,
Antonio M. Rodriguez-Chia
,
Arie Tamir
Lecture Notes in Computer Science
4698
, 2007, pp. 230-240
Optimal algorithms for the path/tree-shaped facility location problems in trees
Binay Bhattacharya
,
Yuzhuang Hu
,
Qiaosheng Shi
,
Arie Tamir
Lecture Notes in Computer Science
4288
, 2006, pp. 379-388
An improved algorithm for the distance constrained
p
-center location problem with mutual communication on tree networks
Arie Tamir
Networks
44
(1), 2004, pp. 38-40
The geometric maximum Traveling Salesman Problem
Alexander Barvinok
,
Sándor P. Fekete
,
David S. Johnson
,
Arie Tamir
,
Gerhard J. Woeginger
,
Russ Woodroofe
Journal of the ACM
50
(5), 2003, pp. 641-664
Minimizing the sum of the
k
largest functions in linear time
Wlodzimierz Ogryczak
,
Arie Tamir
Information Processing Letters
85
(3), 2003, pp. 117-122
The
k
-centrum multi-facility location problem
Arie Tamir
Discrete Applied Mathematics
109
(3), 2001, pp. 293-307
A polynomial algorithm for the
p
-centdian problem on a tree
Arie Tamir
,
Dinisio Pérez-Brito
,
José A. Moreno-Pérez
Networks
32
(4), 1998, pp. 255-262
Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem
Arie Tamir
Discrete Applied Mathematics
87
(1-3), 1998, pp. 229-243
On the location of a tree-shaped facility
Tae Ung Kim
,
Timothy J. Lowe
,
Arie Tamir
,
James E. Ward
Networks
28
(3), 1996, pp. 167-175
On the minimum diameter spanning tree problem
Refael Hassin
,
Arie Tamir
Information Processing Letters
53
, 1995, pp. 109-111
A unifying location model on tree graphs based on submodularity properties
Arie Tamir
Discrete Applied Mathematics
47
, 1993, pp. 275-283
On a tree-shaped facility location problem of Minieka
Ramon Rabinovitch
,
Arie Tamir
Networks
22
(6), 1992, pp. 515-522
The generalized
P
-forest problem on a tree network
Arie Tamir
,
Timothy J. Lowe
Networks
22
(3), 1992, pp. 217-230
Obnoxious facility location on graphs
Arie Tamir
SIAM Journal on Discrete Mathematics
4
(4), 1991, November, pp. 550-567
Improved complexity bounds for center location problems on networks by using dynamic data structures
Arie Tamir
SIAM Journal on Discrete Mathematics
1
, 1988, pp. 377-396
Totally balanced and totally unimodular matrices defined by center location problems
Arie Tamir
Discrete Applied Mathematics
16
, 1987, pp. 245-263
Minimum cost flow algorithms for series-parallel networks
Wolfgang W. Bein
,
Peter Brucker
,
Arie Tamir
Discrete Applied Mathematics
10
, 1985, pp. 117-124
On the solution of discrete bottleneck problems
Arie Tamir
Discrete Applied Mathematics
4
, 1982, pp. 299-302
An
O(N\cdot\log N)
algorithm for a class of matching problems
Nimrod Megiddo
,
Arie Tamir
SIAM Journal on Computing
7
(2), 1978, May, pp. 154-157