Journal: Journal of Combinatorial Optimization

Found 352 papers in total
The k‐coloring fitness landscape
The k‐coloring fitness landscape
2011,
This paper deals with the fitness landscape analysis of the k ‐coloring...
Hardness and algorithms for rainbow connection
Hardness and algorithms for rainbow connection
2011,
An edge‐colored graph G is rainbow connected if any two vertices are connected...
Data aggregation for p‐median problems
Data aggregation for p‐median problems
2011,
In this paper, we use a pseudo‐Boolean formulation of the p ‐median...
Semi‐online scheduling on two uniform machines with the known largest size
Semi‐online scheduling on two uniform machines with the known largest size
2011,
This paper investigates semi‐online scheduling on two uniform machines with the...
Approximating k‐generalized connectivity via collapsing HSTs
Approximating k‐generalized connectivity via collapsing HSTs
2011,
An instance of the k ‐generalized connectivity problem consists of an...
Efficient estimation of the accuracy of the maximum likelihood method for ancestral state reconstruction
Efficient estimation of the accuracy of the maximum likelihood method for ancestral state reconstruction
2011,
The marginal maximum likelihood method is a widely‐used method for ancestral...
On the generalized constrained longest common subsequence problems
On the generalized constrained longest common subsequence problems
2011,
We investigate four variants of the longest common subsequence problem. Given two...
On the number of separable partitions
On the number of separable partitions
2011,
Consider partitions of a given set A of n distinct points in general position in...
A Branch and Cut solver for the maximum stable set problem
A Branch and Cut solver for the maximum stable set problem
2011,
This paper deals with the cutting‐plane approach to the maximum stable set...
Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on‐line scheduling
Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on‐line scheduling
2011,
We consider semi on‐line scheduling on two uniform machines. The speed of the...
On the distance paired domination of generalized Petersen graphs P(n,1) and P(n,2)
On the distance paired domination of generalized Petersen graphs P(n,1) and P(n,2)
2011,
Let G =( V , E ) be a graph without an isolated vertex. A set D ⊆ V ( G ) is a k...
Approximation scheme for restricted discrete gate sizing targeting delay minimization
Approximation scheme for restricted discrete gate sizing targeting delay minimization
2011,
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of...
On the parameterized complexity of the Multi‐MCT and Multi‐MCST problems
On the parameterized complexity of the Multi‐MCT and Multi‐MCST problems
2011,
The comparison of tree structured data is widespread since trees can be used to...
Efficient algorithms for supergraph query processing on graph databases
Efficient algorithms for supergraph query processing on graph databases
2011,
We study the problem of processing supergraph queries on graph databases. A graph...
Approximation and hardness results for label cut and related problems
Approximation and hardness results for label cut and related problems
2011,
We investigate a natural combinatorial optimization problem called the Label Cut...
Bounding the total domination subdivision number of a graph in terms of its order
Bounding the total domination subdivision number of a graph in terms of its order
2011,
The total domination subdivision number sd γ t ( G ) of a graph G is the minimum...
Approximating the chromatic index of multigraphs
Approximating the chromatic index of multigraphs
2011,
It is well known that if G is a multigraph then χ ′( G )≥ χ ′...
Minimizing the sum cost in linear extensions of a poset
Minimizing the sum cost in linear extensions of a poset
2011,
A linear extension problem is defined as follows: Given a poset P =( E ,≤), we want...
Approximating capacitated tree‐routings in networks
Approximating capacitated tree‐routings in networks
2011,
Let G =( V , E ) be a connected graph such that each edge e ∈ E is weighted by a...
Semi‐online scheduling on 2 machines under a grade of service provision with bounded processing times
Semi‐online scheduling on 2 machines under a grade of service provision with bounded processing times
2011,
We study the problem of semi‐online scheduling on 2 machines under a grade of...
Average‐case competitive analyses for one‐way trading
Average‐case competitive analyses for one‐way trading
2011,
Consider a trader who exchanges one dollar into yen and assume that the exchange rate...
A linear programming duality approach to analyzing strictly nonblocking d‐ary multilog networks under general crosstalk constraints
A linear programming duality approach to analyzing strictly nonblocking d‐ary multilog networks under general crosstalk constraints
2011,
When a switching network topology is used for constructing optical...
Visual cryptography on graphs
Visual cryptography on graphs
2011,
In this paper, we consider a new visual cryptography scheme that allows for sharing of...
Covering directed graphs by in‐trees
Covering directed graphs by in‐trees
2011,
Given a directed graph D =( V , A ) with a set of d specified vertices S ={ s 1 ,…, s...
Papers per page: