Journal: Journal of Combinatorial Optimization

Found 352 papers in total
PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs
PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs
2015,
Connected dominating set ( CDS ) has played an important role in building virtual...
Group irregularity strength of connected graphs
Group irregularity strength of connected graphs
2015,
We investigate the group irregularity strength ( s g ( G ) ) of graphs, that is, we...
An algorithm for the dominator chromatic number of a tree
An algorithm for the dominator chromatic number of a tree
2015,
A dominator coloring of a graph G is an assignment of colors to the vertices of G such...
L(d,1)-labelings of the edge-path-replacement by factorization of graphs
L(d,1)-labelings of the edge-path-replacement by factorization of graphs
2015,
For an integer d ≥ 2 , an L ( d , 1 ) ‐labeling of a graph G is a function f...
Handling least privilege problem and role mining in RBAC
Handling least privilege problem and role mining in RBAC
2015,
For a given role‐based access control (RBAC) configuration, user‐role...
An optimal randomized online algorithm for the k-Canadian Traveller Problem on node-disjoint paths
An optimal randomized online algorithm for the k-Canadian Traveller Problem on node-disjoint paths
2015,
We consider the k ‐Canadian Traveller Problem, which asks for a shortest path...
Better approximation algorithms for influence maximization in online social networks
Better approximation algorithms for influence maximization in online social networks
2015,
Influence maximization is a classic and hot topic in social networks. In this paper,...
Game domination subdivision number of a graph
Game domination subdivision number of a graph
2015,
The game domination subdivision number of a graph G is defined by the following game....
Dual power assignment optimization and fault tolerance in WSNs
Dual power assignment optimization and fault tolerance in WSNs
2015,
Because of limited battery equipped on each sensor, power consumption is one of the...
A new randomized algorithm for group testing with unknown number of defective items
A new randomized algorithm for group testing with unknown number of defective items
2015,
In many fault detection problems, we want to identify defective items from a set of n...
On the complexity of partitioning a graph into a few connected subgraphs
On the complexity of partitioning a graph into a few connected subgraphs
2015,
Given a graph G , a sequence τ = ( n 1 , … , n p ) of positive integers...
Distance‐d independent set problems for bipartite and chordal graphs
Distance‐d independent set problems for bipartite and chordal graphs
2014,
The paper studies a generalization of the Independent Set problem ( IS for short). A...
Radiation hybrid map construction problem parameterized
Radiation hybrid map construction problem parameterized
2014,
In this paper, we study the Radiation hybrid map construction ( R H M C ) problem...
Minimum diameter cost‐constrained Steiner trees
Minimum diameter cost‐constrained Steiner trees
2014,
Given an edge‐weighted undirected graph G = ( V , E , c , w ) where each edge e...
Algorithms for local similarity between forests
Algorithms for local similarity between forests
2014,
An ordered labelled tree is a tree where the left‐to‐right order among...
On‐line bin packing with restricted repacking
On‐line bin packing with restricted repacking
2014,
Semi‐on‐line algorithms for the bin‐packing problem allow, in...
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
2014,
A k ‐colouring of a graph G =( V , E ) is a mapping c : V →{1,2,…,...
The domination number of Cartesian product of two directed paths
The domination number of Cartesian product of two directed paths
2014,
Let γ ( P m □ P n ) be the domination number of the Cartesian product of...
The subdivision‐constrained routing requests problem
The subdivision‐constrained routing requests problem
2014,
We are given a digraph D =( V , A ; w ), a length (delay) function w : A → R...
Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
2014,
We study the problems of non‐preemptively scheduling and packing malleable and...
Competitive analysis for make‐to‐order scheduling with reliable lead time quotation
Competitive analysis for make‐to‐order scheduling with reliable lead time quotation
2014,
This paper makes extended studies on the discrete problem of online scheduling and...
On the generalized multiway cut in trees problem
On the generalized multiway cut in trees problem
2014,
Given a tree T = ( V , E ) with n vertices and a collection of terminal sets D = { S 1...
On certain geometric properties of the Yao–Yao graphs
On certain geometric properties of the Yao–Yao graphs
2014,
We show that, for any constant ρ > 1 , there exists an integer constant k such...
Online bottleneck matching
Online bottleneck matching
2014,
We consider the online bottleneck matching problem, where k server‐vertices lie...
Papers per page: