Zhang Zhao

Zhao Zhang

Information about the author Zhao Zhang will soon be added to the site.
Found 10 papers in total
iGreen: green scheduling for peak demand minimization
iGreen: green scheduling for peak demand minimization
2017
Home owners are typically charged differently when they consume power at different...
Optimization model for regional evacuation transportation system using macroscopic productivity function
Optimization model for regional evacuation transportation system using macroscopic productivity function
2015
The simulation of mass evacuation traffic processes, while enormously valuable in...
Constant‐approximation for optimal data aggregation with physical interference
Constant‐approximation for optimal data aggregation with physical interference
2013
In this paper, we study the aggregation problem with power control under the physical...
Spanning 3‐connected index of graphs
Spanning 3‐connected index of graphs
2014
For an integer s > 0 and for u , v ∈ V ( G ) with u ≠ v , an ( s ; u , v...
On cyclic vertex‐connectivity of Cartesian product digraphs
On cyclic vertex‐connectivity of Cartesian product digraphs
2012
For a strongly connected digraph D =( V ( D ), A ( D )), a vertex‐cut S ⊆...
Radar placement along banks of river
Radar placement along banks of river
2012
In this paper, we consider the Radar Placement and Power Assignment problem (RPPA)...
Algorithms for the minimum weight k‐fold (connected) dominating set problem
Algorithms for the minimum weight k‐fold (connected) dominating set problem
2012
In this paper, we study the problem of computing a minimum weight k ‐fold...
Super cyclically edge connected transitive graphs
Super cyclically edge connected transitive graphs
2011
A cyclic edge‐cut of a graph G is an edge set, the removal of which separates...
PTAS for minimum weighted connected vertex cover problem with c‐local condition in unit disk graphs
PTAS for minimum weighted connected vertex cover problem with c‐local condition in unit disk graphs
2011
Given a graph G =( V , E ) with node weight w : V → R + , the minimum...
Super-connected n-th iterated line digraphs
Super-connected n-th iterated line digraphs
2005
In this paper, we show that under the condition that the minimum degree is at least 3,...
Papers per page: