Journal: Journal of Combinatorial Optimization

Found 352 papers in total
Honeynet games: a game theoretic approach to defending network monitors
Honeynet games: a game theoretic approach to defending network monitors
2011,
A honeynet is a portion of routed but otherwise unused address space that is...
SIRALINA: efficient two‐steps heuristic for storage optimisation in single period task scheduling
SIRALINA: efficient two‐steps heuristic for storage optimisation in single period task scheduling
2011,
In this paper, we study the general problem of one‐dimensional periodic task...
Polynomially solvable special cases of the quadratic bottleneck assignment problem
Polynomially solvable special cases of the quadratic bottleneck assignment problem
2011,
Quadratic bottleneck assignment problems (QBAP) are obtained by replacing the addition...
Minimum d‐blockers and d‐transversals in graphs
Minimum d‐blockers and d‐transversals in graphs
2011,
We consider a set V of elements and an optimization problem on V : the search for a...
A modified power spectral density test applied to weighing matrices with small weight
A modified power spectral density test applied to weighing matrices with small weight
2011,
The power spectral density test has been used for at least a decade in the search for...
Improving an upper bound on the size of k‐regular induced subgraphs
Improving an upper bound on the size of k‐regular induced subgraphs
2011,
This paper considers the NP‐hard graph problem of determining a maximum...
A generalization of Macula’s disjunct matrices
A generalization of Macula’s disjunct matrices
2011,
As a generalization of the novel construction of disjunct matrices by Macula (1996),...
Resource‐sharing systems and hypergraph colorings
Resource‐sharing systems and hypergraph colorings
2011,
A resource‐sharing system is modeled by a hypergraph H in which a vertex...
Optimal on‐line algorithms for one batch machine with grouped processing times
Optimal on‐line algorithms for one batch machine with grouped processing times
2011,
In this paper, we study on‐line scheduling problems on a batch machine with the...
The Maximum Box Problem for moving points in the plane
The Maximum Box Problem for moving points in the plane
2011,
Given a set R of r red points and a set B of b blue points in the plane, the static...
Selfish bin coloring
Selfish bin coloring
2011,
The bin packing problem, a classical problem in combinatorial optimization, has...
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...
On the vertex characterization of single‐shape partition polytopes
On the vertex characterization of single‐shape partition polytopes
2011,
Given a partition of distinct d ‐dimensional vectors into p parts, the...
Revised GRASP with path‐relinking for the linear ordering problem
Revised GRASP with path‐relinking for the linear ordering problem
2011,
The linear ordering problem (LOP) is an 𝒩𝒫 ‐hard combinatorial...
Optimality conditions for a bilevel matroid problem
Optimality conditions for a bilevel matroid problem
2011,
In bilevel programming there are two decision makers, the leader and the follower, who...
A closest vector problem arising in radiation therapy planning
A closest vector problem arising in radiation therapy planning
2011,
In this paper we consider the following closest vector problem . We are given a set of...
Optimal tree structure with loyal users and batch updates
Optimal tree structure with loyal users and batch updates
2011,
We study the probabilistic model in the key tree management problem. Users have...
Co‐2‐plex polynomials
Co‐2‐plex polynomials
2011,
This paper offers a generalization of the independence polynomial, the co‐ k...
On domination number of Cartesian product of directed paths
On domination number of Cartesian product of directed paths
2011,
Let γ ( G ) denote the domination number of a digraph G and let P m □ P n...
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...
Optimal semi‐online algorithm for scheduling with rejection on two uniform machines
Optimal semi‐online algorithm for scheduling with rejection on two uniform machines
2011,
In this paper we consider a semi‐online scheduling problem with rejection on...
Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
2011,
In this paper, we study the parameterized complexity of Dominating Set problem in...
Geometric rounding: a dependent randomized rounding scheme
Geometric rounding: a dependent randomized rounding scheme
2011,
We develop a new dependent randomized rounding method for approximation of a number of...
Improved floor‐planning of graphs via adjacency‐preserving transformations
Improved floor‐planning of graphs via adjacency‐preserving transformations
2011,
Let G =( V , E ) and G ′=( V ′, E ′) be two graphs, an...
Papers per page: