Journal: Journal of Combinatorial Optimization

Found 352 papers in total
Spanning 3‐connected index of graphs
Spanning 3‐connected index of graphs
2014,
For an integer s > 0 and for u , v ∈ V ( G ) with u ≠ v , an ( s ; u , v...
The edge‐centered surface area of the arrangement graph
The edge‐centered surface area of the arrangement graph
2014,
We suggest the notion of the edge‐centered surface area for an interconnection...
Optimal job insertion in the no‐wait job shop
Optimal job insertion in the no‐wait job shop
2013,
The no‐wait job shop (NWJS) considered here is a version of the job shop...
The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
2013,
Comparing and ranking information is an important topic in social and information...
Objective functions with redundant domains
Objective functions with redundant domains
2013,
Let ( E , 𝒜 ) be a set system consisting of a finite collection 𝒜 of subsets...
L(2,1)‐labelings of the edge‐path‐replacement of a graph
L(2,1)‐labelings of the edge‐path‐replacement of a graph
2013,
For two positive integers j and k with j ≥ k , an L ( j , k )‐labeling of a...
Super‐cyclically edge‐connected regular graphs
Super‐cyclically edge‐connected regular graphs
2013,
A cyclic edge‐cut of a graph G is an edge set, the removal of which separates...
The k‐Canadian Travelers Problem with communication
The k‐Canadian Travelers Problem with communication
2013,
This paper studies a variation of the online k ‐Canadian Traveler Problem ( k...
Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
2013,
We consider a temperature‐aware online deadline scheduling model. The objective...
Online algorithms for 1‐space bounded multi dimensional bin packing and hypercube packing
Online algorithms for 1‐space bounded multi dimensional bin packing and hypercube packing
2013,
In this paper, we study 1‐space bounded multi‐dimensional bin packing...
On some geometric problems of color‐spanning sets
On some geometric problems of color‐spanning sets
2013,
In this paper we study several geometric problems of color‐spanning sets: given...
Approximation algorithm for uniform bounded facility location problem
Approximation algorithm for uniform bounded facility location problem
2013,
The uniform bounded facility location problem (UBFLP) seeks for the optimal way of...
A tight analysis of Brown‐Baker‐Katseff sequences for online strip packing
A tight analysis of Brown‐Baker‐Katseff sequences for online strip packing
2013,
We study certain adversary sequences for online strip packing which were first...
Tight approximation bounds for combinatorial frugal coverage algorithms
Tight approximation bounds for combinatorial frugal coverage algorithms
2013,
We consider the frugal coverage problem, an interesting variation of set cover defined...
Equivalence of two conjectures on equitable coloring of graphs
Equivalence of two conjectures on equitable coloring of graphs
2013,
A graph G is said to be equitably k ‐colorable if there exists a proper k...
Structure of Fibonacci cubes: a survey
Structure of Fibonacci cubes: a survey
2013,
The Fibonacci cube Γ n is the subgraph of the n ‐cube induced by the...
Enumerating the edge‐colourings and total colourings of a regular graph
Enumerating the edge‐colourings and total colourings of a regular graph
2013,
In this paper, we are interested in computing the number of edge colourings and total...
The decycling number of outerplanar graphs
The decycling number of outerplanar graphs
2013,
For a graph G , let τ ( G ) be the decycling number of G and c ( G ) be the number...
(p,q)‐total labeling of complete graphs
(p,q)‐total labeling of complete graphs
2013,
Given a graph G and positive integers p , q with p ≥ q , the ( p , q )‐total...
Acyclic edge coloring of planar graphs without 4‐cycles
Acyclic edge coloring of planar graphs without 4‐cycles
2013,
An acyclic edge coloring of a graph G is a proper edge coloring such that no...
The partition method for poset‐free families
The partition method for poset‐free families
2013,
Given a finite poset P , let L a ( n , P ) denote the largest size of a family of...
On total weight choosability of graphs
On total weight choosability of graphs
2013,
For a graph G with vertex set V and edge set E , a ( k , k ′)‐total list...
A note on optimal pebbling of hypercubes
A note on optimal pebbling of hypercubes
2013,
A pebbling move consists of removing two pebbles from one vertex and then placing one...
The broadcast median problem in heterogeneous postal model
The broadcast median problem in heterogeneous postal model
2013,
We propose the problem of finding broadcast medians in heterogeneous networks. A...
Papers per page: