Optimal linear-time algorithm for uplink scheduling of packets with hard deadlines in WiMAX

2008 ◽  
Author(s):  
Arezou Mohammadi ◽  
Selim G. Akl ◽  
Firouz Behnamfar
Keyword(s):  
Linear Time ◽  
Time Algorithm ◽  
Linear Time Algorithm ◽  
Uplink Scheduling ◽  
Optimal Linear

MANHATTONIAN PROXIMITY IN A SIMPLE POLYGON

1995 ◽  
Vol 05 (01n02) ◽  
pp. 53-74 ◽  
Author(s):  
ROLF KLEIN ◽  
ANDRZEJ LINGAS
Keyword(s):  
Voronoi Diagram ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Linear Time ◽  
Simple Polygon ◽  
Time Algorithm ◽  
Linear Time Algorithm ◽  
Manhattan Metric ◽  
Optimal Linear ◽  
Planar Polygon

Let P be a simple planar polygon. We present a linear time algorithm for constructing the bounded Voronoi diagram of P in the Manhattan metric, where each point z in P belongs to the region of the closest vertex of P that is visible from z. Among other consequences, the minimum spanning tree of the vertices in the Manhattan metric that is contained in P can be computed within optimal linear time. The same results hold for the L∞-metric.α

scholarly journals An optimal linear time algorithm for quasi-monotonic segmentation1

2009 ◽  
Vol 86 (7) ◽  
pp. 1093-1104 ◽  
Author(s):  
Daniel Lemire ◽  
Martin Brooks ◽  
Yuhong Yan
Keyword(s):  
Linear Time ◽  
Time Algorithm ◽  
Linear Time Algorithm ◽  
Optimal Linear

scholarly journals Total Roman {3}-Domination: The Complexity and Linear-Time Algorithm for Trees

Mathematics ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 293
Author(s):  
Xinyue Liu ◽  
Huiqin Jiang ◽  
Pu Wu ◽  
Zehui Shao
Keyword(s):  
Linear Time ◽  
Minimum Weight ◽  
Domination Number ◽  
Time Algorithm ◽  
Simple Graph ◽  
Linear Time Algorithm ◽  
Domination Problem ◽  
Np Complete ◽  
Chordal Bipartite Graphs ◽  
Dominating Function

For a simple graph G=(V,E) with no isolated vertices, a total Roman {3}-dominating function(TR3DF) on G is a function f:V(G)→{0,1,2,3} having the property that (i) ∑w∈N(v)f(w)≥3 if f(v)=0; (ii) ∑w∈N(v)f(w)≥2 if f(v)=1; and (iii) every vertex v with f(v)≠0 has a neighbor u with f(u)≠0 for every vertex v∈V(G). The weight of a TR3DF f is the sum f(V)=∑v∈V(G)f(v) and the minimum weight of a total Roman {3}-dominating function on G is called the total Roman {3}-domination number denoted by γt{R3}(G). In this paper, we show that the total Roman {3}-domination problem is NP-complete for planar graphs and chordal bipartite graphs. Finally, we present a linear-time algorithm to compute the value of γt{R3} for trees.

Sign in / Sign up

Export Citation Format

Share Document