Kang Liying

Liying Kang

Information about the author Liying Kang will soon be added to the site.
Found 8 papers in total
Two efficient values of cooperative games with graph structure based on τ-values
Two efficient values of cooperative games with graph structure based on τ-values
2017
The paper is devoted to value concepts for cooperative games with a communication...
Matching and domination numbers in r-uniform hypergraphs
Matching and domination numbers in r-uniform hypergraphs
2017
A matching is a set of pairwise disjoint hyperedges of a hypergraph H . The matching...
Online scheduling on uniform machines with two hierarchies
Online scheduling on uniform machines with two hierarchies
2012
In this paper we study online scheduling problem on m parallel uniform machines with...
Perfect matchings in paired domination vertex critical graphs
Perfect matchings in paired domination vertex critical graphs
2012
A vertex subset S of a graph G =( V , E ) is a paired dominating set if every vertex...
On the power domination number of the generalized Petersen graphs
On the power domination number of the generalized Petersen graphs
2011
The problem of monitoring an electric power system by placing as few measurement...
An improved algorithm for the p-center problem on interval graphs with unit lengths
An improved algorithm for the p-center problem on interval graphs with unit lengths
2007
The p -center problem is to locate p facilities in a network of n demand points so as...
A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs
A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs
2007
In this paper we study the NP-hard problem of scheduling n deteriorating jobs on m...
Batch-processing scheduling with setup times
Batch-processing scheduling with setup times
2004
The problem is to minimize the total weighted completion time on a single...
Papers per page: