Author image not provided
 Tzuchin Lin

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article1.71
Citation Count12
Publication count7
Publication years2001-2009
Available for download1
Average downloads per article462.00
Downloads (cumulative)462
Downloads (12 Months)10
Downloads (6 Weeks)0
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


7 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 7 of 7
Sort by:

1
December 2009 Journal of Computer and System Sciences: Volume 75 Issue 8, December, 2009
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 0

In this paper, we study the inverse sorting problem with bound constraints under the l"~-norm and the Hamming distance. For the problem under the l"~-norm, an O(nlogn)-time algorithm is presented. For the problem under the Hamming distance, we first show that it has an @W(nlogn)-time lower bound in the comparison ...
Keywords: Algorithms, Isotonic regression, Lower bounds, Sorting, Inverse optimization, Hamming distance, lp-norm

2
June 2009 ISAAC '01: Proceedings of the 12th International Symposium on Algorithms and Computation
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3

The p -median problem on a tree T is to find a set S of p vertices on T that minimize the sum of distances from T 's vertices to S . For this problem, Tamir [12] had an O ( pn 2 )-time algorithm, while Gavish and Sridhar [1] ...

3 published by ACM
July 2008 ACM Transactions on Algorithms (TALG): Volume 4 Issue 3, June 2008
Publisher: ACM
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 0,   Downloads (12 Months): 10,   Downloads (Overall): 462

Full text available: PDFPDF
In this article, efficient algorithms are presented for the minmax-regret 1-center and 1-median problems on a general graph and a tree with uncertain vertex weights. For the minmax-regret 1-center problem on a general graph, we improve the previous upper bound from O ( mn 2 log n ) to O ...
Keywords: Location theory, centers, general graphs, medians, trees, minmax-regret optimization

4
July 2008 Information and Computation: Volume 206 Issue 7, July, 2008
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 0

In this paper, we study the problem of locating a median path of limited length on a tree under the condition that some existing facilities are already located. The existing facilities may be located at any subset of vertices. Upper and lower bounds are proposed for both the discrete and ...
Keywords: Centers, Medians, Algorithms, Conditional location problems, Location theory, Trees, Paths

5
December 2006 ISAAC'06: Proceedings of the 17th international conference on Algorithms and Computation
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

This paper studies the problem of finding the 1-center on a graph where vertex weights are uncertain and the uncertainty is characterized by given intervals. It is required to find a minmax-regret solution, which minimizes the worst-case loss in the objective function. Averbakh and Berman had an O ( mn ...
Keywords: minmax-regret optimization, location theory, centers

6
August 2006 COCOON'06: Proceedings of the 12th annual international conference on Computing and Combinatorics
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

This paper studies the problem of finding the 1-median on a graph where vertex weights are uncertain and the uncertainty is characterized by given intervals. It is required to find a minmax regret solution, which minimizes the worst-case loss in the objective function. Averbakh and Berman had an O ( ...
Keywords: location theory, medians, minmax regret optimization

7
December 2001 ISAAC '01: Proceedings of the 12th International Symposium on Algorithms and Computation
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3

The p -median problem on a tree T is to find a set S of p vertices on T that minimize the sum of distances from T 's vertices to S . For this problem, Tamir [12] had an O ( pn 2 )-time algorithm, while Gavish and Sridhar [1] ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us