Search

Your search keyword '"Yao, Enyu"' showing total 23 results
Start Over Author "Yao, Enyu"
23 results on '"Yao, Enyu"'

1. Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance

Author

Liu, Longcheng, Chen, Yong, Wu, Biao, Yao, Enyu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Snoeyink, Jack, editor, Lu, Pinyan, editor, Su, Kaile, editor, and Wang, Lusheng, editor

Published
2012
Full Text
View/download PDF

2. Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance

Author

Liu, Longcheng, Yao, Enyu, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Chen, Bo, editor, Paterson, Mike, editor, and Zhang, Guochuan, editor

Published
2007
Full Text
View/download PDF

23. Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance.

Author

Hutchison, David, Kanade, Takeo, Kittler, Josef, Kleinberg, Jon M., Mattern, Friedemann, Mitchell, John C., Naor, Moni, Nierstrasz, Oscar, Pandu Rangan, C., Steffen, Bernhard, Sudan, Madhu, Terzopoulos, Demetri, Tygar, Doug, Vardi, Moshe Y., Weikum, Gerhard, Chen, Bo, Paterson, Mike, Zhang, Guochuan, Liu, Longcheng, and Yao, Enyu

Abstract

The inverse optimization problem is to modify the weight (or cost, length, capacity and so on) such that a given feasible solution becomes an optimal solution. In this paper, we consider the inverse min-max spanning tree problem under the weighted sum-type Hamming distance. For the model considered, we present its combinatorial algorithm that run in strongly polynomial times. [ABSTRACT FROM AUTHOR]

Published
2007
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results