Journal: Journal of Combinatorial Optimization

Found 352 papers in total
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 ⊆...
Note on the hardness of generalized connectivity
Note on the hardness of generalized connectivity
2012,
Let G be a nontrivial connected graph of order n and let k be an integer with 2≤ k...
Minimum statuses of connected graphs with fixed maximum degree and order
Minimum statuses of connected graphs with fixed maximum degree and order
2012,
The status of a vertex in a connected graph is the sum of distances between the vertex...
A bicriteria approach to scheduling a single machine with job rejection and positional penalties
A bicriteria approach to scheduling a single machine with job rejection and positional penalties
2012,
Single machine scheduling problems have been extensively studied in the literature...
A combinatorial model and algorithm for globally searching community structure in complex networks
A combinatorial model and algorithm for globally searching community structure in complex networks
2012,
Community structure is one of the important characteristics of complex networks. In...
A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs
A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs
2012,
In the minimum weighted dominating set problem (MWDS), we are given a unit disk graph...
Hamiltonian numbers of Möbius double loop networks
Hamiltonian numbers of Möbius double loop networks
2012,
For the study of hamiltonicity of graphs and digraphs, Goodman and Hedetniemi...
Fault‐tolerant diameter for three family interconnection networks
Fault‐tolerant diameter for three family interconnection networks
2012,
Let G =( V , E ) be an k ‐connected graph. The ( k...
An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
2012,
This paper consider m uniform (parallel) machine scheduling with linear deterioration...
Exact and approximation algorithms for the complementary maximal strip recovery problem
Exact and approximation algorithms for the complementary maximal strip recovery problem
2012,
Given two genomic maps G 1 and G 2 each represented as a sequence of n gene markers,...
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...
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...
Flattening topologically spherical surface
Flattening topologically spherical surface
2012,
The problem of optimal surface flattening in 3‐D finds many applications in...
Multi‐bidding strategy in sponsored search auctions
Multi‐bidding strategy in sponsored search auctions
2012,
The generalized second price auction has recently become a much studied model for...
Estimating hybrid frequency moments of data streams
Estimating hybrid frequency moments of data streams
2012,
We consider the problem of estimating hybrid frequency moments of two dimensional data...
Optimal algorithms for online time series search and one‐way trading with interrelated prices
Optimal algorithms for online time series search and one‐way trading with interrelated prices
2012,
The basic models of online time series search and one-way trading are introduced by...
Packing cycles exactly in polynomial time
Packing cycles exactly in polynomial time
2012,
Let G =( V , E ) be an undirected graph in which every vertex v ∈ V is assigned a...
An optimal online algorithm for single machine scheduling to minimize total general completion time
An optimal online algorithm for single machine scheduling to minimize total general completion time
2012,
We study the online problem of single machine scheduling to minimize total general...
Models for the single‐vehicle preemptive pickup and delivery problem
Models for the single‐vehicle preemptive pickup and delivery problem
2012,
In this paper, we study a variant of the well‐known single‐vehicle...
Multi‐way clustering and biclustering by the Ratio cut and Normalized cut in graphs
Multi‐way clustering and biclustering by the Ratio cut and Normalized cut in graphs
2012,
In this paper, we consider the multi‐way clustering problem based on graph...
The total {k}‐domatic number of a graph
The total {k}‐domatic number of a graph
2012,
For a positive integer k , a total { k }‐ dominating function of a graph G is a...
An inverse approach to convex ordered median problems in trees
An inverse approach to convex ordered median problems in trees
2012,
The convex ordered median problem is a generalization of the median, the k...
The complexity of VLSI power‐delay optimization by interconnect resizing
The complexity of VLSI power‐delay optimization by interconnect resizing
2012,
The lithography used for 32 nanometers and smaller VLSI process technologies restricts...
Constructing weakly connected dominating set for secure clustering in distributed sensor network
Constructing weakly connected dominating set for secure clustering in distributed sensor network
2012,
Secure clustering problem plays an important role in distributed sensor networks....
Papers per page: