Maggie X. Cheng, Mihaela Cardei, Jianhua Sun, Xiaochun Cheng, Senior Member, Yinfeng Xu, ...
Abstract—In ad hoc wireless networks, to compute the transmission power of each wireless node such that the resulting network is connected and the total energy consumption is minimized is defined...
3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING (2007)
A Simple Factor, Alexander Wolff, Michael Thon, Yinfeng Xu
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touches exactly two...
On constrained minimum pseudotriangulations (2003)
Günter Rote, Cao An Wang, Lusheng Wang, Yinfeng Xu
Abstract. In this paper, we show some properties of a pseudotriangle and present three combinatorial bounds: the ratio of the size of minimum pseudotriangulation of a point set S and the size of...
On constrained minimum pseudotriangulations (2003)
Günter Rote, Lusheng Wang, Yinfeng Xu
Abstract. In this paper, we show some properties of a pseudotriangle and present three combinatorial bounds: the ratio of the size of minimum pseudotriangulation of a point set S and the size of...
On Constrained Minimum Pseudotriangulations (2003)
Günter Rote, Cao An Wang, Lusheng Wang, Yinfeng Xu
In this paper, we show some properties of a pseudotriangle and present three combinatorial bounds: the ratio of the size of minimum pseudotriangulation of a point set S and the size of minimal...
Approximating uniform triangular meshes in polygons,” Theor (2002)
Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yinfeng Xu
Given a convex polygon P in the plane and a positive integer n, weconsider the problem of generating a length-uniform triangular mesh for the interior of P using n Steiner points. More specifically,...
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touches exactly two...
New Algorithms for Two-Label Point Labeling (2000)
Zhongping Qin, Alexander Wolff, Yinfeng Xu, Binhai Zhu
. Given a label shape L and a set of n points in the plane, the 2-label point-labeling problem consists of placing 2n non-intersecting translated copies of L of maximum size such that each point...
New Algorithms for Two-Label Point Labeling (2000)
Zhongping Qin, Alexander Wolff, Yinfeng Xu, Binhai Zhu
Given a label shape L and a set of n points in the plane, the two-label point-labeling problem consists of placing 2n non-intersecting translated copies of L of maximum size such that each point...
On consistency measures of linguistic preference relations
Dong, Yucheng, Xu, Yinfeng, Li, Hongyi
Inspired by the concept of deviation measure between two linguistic preference relations, this paper further defines the deviation measure of a linguistic preference relation to the set of consistent...
A Better Lower Bound for Two-Circle Point Labeling
Alexander Wolff, Michael Thon, Yinfeng Xu
. Given a set P of n points in the plane, the two-circle pointlabeling problem consists of placing 2n uniform, non-intersecting, maximum -size open circles such that each point touches exactly two...