Journal: SIAM Journal On Discrete Mathematics

Found 12 papers in total
An optimal acceptance policy for an urn scheme
An optimal acceptance policy for an urn scheme
1998,
An urn contains m balls of value –1 and p balls of value +1. At each turn a...
Task scheduling in networks
Task scheduling in networks
1997,
Scheduling a set of tasks on a set of machines so as to yield an efficient schedule is...
Equidistribution in all dimensions of worst-case point sets for the traveling salesman problem
Equidistribution in all dimensions of worst-case point sets for the traveling salesman problem
1995,
Given a set S of n points in the unit square [0,1]’ d, an optimal traveling...
From linear separability to unimodality: A hierarchy of pseudo-Boolean functions
From linear separability to unimodality: A hierarchy of pseudo-Boolean functions
1988,
When an injective pseudo-Boolean function f : B n ⇒&λτ;∼ is...
A new heuristic for partitioning the nodes of a graph
A new heuristic for partitioning the nodes of a graph
1988,
There is a class of graph partitioning algorithms which improve an initial partition...
A class of polynomially soluable set-covering problems
A class of polynomially soluable set-covering problems
1988,
A clutter L is a collection of m subsets of a ground set E ( L )={ x 1 ,..., x n }...
Total domination and irredundance in weighted interval graphs
Total domination and irredundance in weighted interval graphs
1988,
In an undirected graph, a subset X of the nodes is a total dominating set if each node...
Matroids and subset interconnection design
Matroids and subset interconnection design
1988,
A problem arising in the design of vacuum systems and having applications to some...
Extremum properties of hexagonal partitioning and the uniform distribution in Euclidean location
Extremum properties of hexagonal partitioning and the uniform distribution in Euclidean location
1988,
A zero-sum game with a maximizer that selects a point x in given polygon R in the...
Improved complexity bounds for center location problems on networks by using dynamic data structures
Improved complexity bounds for center location problems on networks by using dynamic data structures
1988,
Several center location problems on general networks and even on tree networks are...
Intersection of two matroids: (Condensed) border graphs and ranking
Intersection of two matroids: (Condensed) border graphs and ranking
1989,
Given two matroids M 1 =( E ,ℐ 1 ) and M 2 =( E ,ℐ 2 ), three algorithms for...
Scheduling tree-structured tasks on two processors to minimize schedule length
Scheduling tree-structured tasks on two processors to minimize schedule length
1989,
Consider a set of n tasks with a tree-structured precedence relation and execution...
Papers per page: