The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Arie Tamir: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi, Arie Tamir
    Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:379-388 [Conf]
  2. M. Brenda Rayco, Richard L. Francis, Arie Tamir
    A p-center grid-positioning aggregation procedure. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1999, v:26, n:10-11, pp:1113-1124 [Journal]
  3. Arie Tamir
    Emanuel Melachrinoudis and Frank GuangSheng Zhang, "An O(mn) algorithm for the 1-maximin problem on a network". Computers and Operations Research 26 (1999) 849-869. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2001, v:28, n:2, pp:189- [Journal]
  4. Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe
    The Geometric Maximum Traveling Salesman Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  5. Nir Halman, Arie Tamir
    Continuous bottleneck tree partitioning problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:140, n:1-3, pp:185-206 [Journal]
  6. Y. Kaufman, Arie Tamir
    Locating Service Centers with Precedence Constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:47, n:3, pp:251-261 [Journal]
  7. Juan A. Mesa, Justo Puerto, Arie Tamir
    Improved algorithms for several network location problems with equality measures. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:3, pp:437-448 [Journal]
  8. Arie Tamir
    The k-centrum multi-facility location problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:109, n:3, pp:293-307 [Journal]
  9. Arie Tamir
    A Unifying Location Model on Tree Graphs Based on Submodularity Properties. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:47, n:3, pp:275-283 [Journal]
  10. Arie Tamir
    Fully Polynomial Approximation Schemes for Locating a Tree-shaped Facility: a Generalization of the Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:229-243 [Journal]
  11. Arie Tamir, Justo Puerto, Dionisio Pérez-Brito
    The centdian subtree on tree networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:118, n:3, pp:263-278 [Journal]
  12. Sergei Bespamyatnikh, Klara Kedem, Michael Segal, Arie Tamir
    Optimal Facility Location Under Various Distance Functions. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2000, v:10, n:5, pp:523-534 [Journal]
  13. Refael Hassin, Arie Tamir
    On the Minimum Diameter Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:53, n:2, pp:109-111 [Journal]
  14. Wlodzimierz Ogryczak, Arie Tamir
    Minimizing the sum of the k largest functions in linear time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:3, pp:117-122 [Journal]
  15. Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe
    The geometric maximum traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:5, pp:641-664 [Journal]
  16. Arie Tamir, Justo Puerto, Juan A. Mesa, Antonio M. Rodríguez-Chía
    Conditional location of path and tree shaped facilities on trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:56, n:1, pp:50-75 [Journal]
  17. R. Chandrasekaran, Arie Tamir
    Algebraic Optimization: The Fermat-Weber Location Problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1990, v:46, n:, pp:219-224 [Journal]
  18. Dorit S. Hochbaum, Nimrod Megiddo, Joseph Naor, Arie Tamir
    Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:69-83 [Journal]
  19. Justo Puerto, Arie Tamir
    Locating tree-shaped facilities using the ordered median objective. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2005, v:102, n:2, pp:313-338 [Journal]
  20. Arie Tamir
    On the core of network synthesis games. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:123-135 [Journal]
  21. Arie Tamir
    A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:59, n:, pp:117-132 [Journal]
  22. Arie Tamir
    The least element property of center location on tree networks with applications to distance and precedence constrained problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:475-496 [Journal]
  23. Arie Tamir
    A distance constrained p-facility location problem on the real line. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1994, v:66, n:, pp:201-204 [Journal]
  24. Arie Tamir, Joseph S. B. Mitchell
    A maximum b-matching problem arising from median location models with applications to the roommates problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:80, n:, pp:171-194 [Journal]
  25. Richard L. Francis, Timothy J. Lowe, Arie Tamir
    Worst-case incremental analysis for a class of p-facility location problems. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:39, n:3, pp:139-143 [Journal]
  26. Tae Ung Kim, Timothy J. Lowe, Arie Tamir, James E. Ward
    On the location of a tree-shaped facility. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:28, n:3, pp:167-175 [Journal]
  27. Arie Tamir
    An improved algorithm for the distance constrained p-center location problem with mutual communication on tree networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:1, pp:38-40 [Journal]
  28. Arie Tamir, Dionisio Pérez-Brito, José A. Moreno-Pérez
    A polynomial algorithm for the p-centdian problem on a tree. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:32, n:4, pp:255-262 [Journal]
  29. Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir, Dionisio Pérez-Brito
    The bi-criteria doubly weighted center-median path problem on a tree. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:47, n:4, pp:237-247 [Journal]
  30. Refael Hassin, Shlomi Rubinstein, Arie Tamir
    Approximation algorithms for maximum dispersion. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1997, v:21, n:3, pp:133-137 [Journal]
  31. Vernon Ning Hsu, Timothy J. Lowe, Arie Tamir
    Structured p-facility location problems on the line solvable in polynomial time. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1997, v:21, n:4, pp:159-164 [Journal]
  32. Jörg Kalcsics, Stefan Nickel, Justo Puerto, Arie Tamir
    Algorithmic results for ordered median problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:3, pp:149-158 [Journal]
  33. Arie Tamir
    Sorting weighted distances with applications to objective function evaluations in single facility location problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:3, pp:249-257 [Journal]
  34. Arie Tamir
    Locating two obnoxious facilities using the weighted maximin criterion. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:1, pp:97-105 [Journal]
  35. Nimrod Megiddo, Arie Tamir
    An O(N log N) Algorithm for a Class of Matching Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:2, pp:154-157 [Journal]
  36. Nimrod Megiddo, Arie Tamir
    New Results on the Complexity of p-Center Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:4, pp:751-758 [Journal]
  37. Nimrod Megiddo, Arie Tamir, Eitan Zemel, R. Chandrasekaran
    An O(n log² n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:2, pp:328-337 [Journal]
  38. Arie Tamir
    Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:3, pp:377-396 [Journal]
  39. Arie Tamir
    Obnoxious Facility Location on Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:4, pp:550-567 [Journal]
  40. Richard L. Francis, Timothy J. Lowe, Arie Tamir, H. Emir-Farinas
    A framework for demand point and solution space aggregation analysis for location models. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2004, v:159, n:3, pp:574-585 [Journal]
  41. Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir
    New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:230-240 [Conf]
  42. Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi, Arie Tamir
    Efficient algorithms for center problems in cactus networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:378, n:3, pp:237-252 [Journal]

  43. Centdian Computation for Sensor Networks. [Citation Graph (, )][DBLP]


  44. Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees. [Citation Graph (, )][DBLP]


  45. On the Planar Piecewise Quadratic 1-Center Problem. [Citation Graph (, )][DBLP]


  46. Center location problems on tree graphs with subtree-shaped customers. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002