Sciweavers

383 search results - page 13 / 77
» A Bound on the Total Chromatic Number
Sort
View
ISIPTA
2003
IEEE
14 years 27 days ago
Bounding Analysis of Lung Cancer Risks Using Imprecise Probabilities
For cancers with more than one risk factor, the sum of probabilistic estimates of the number of cancers attributable to each individual factor may exceed the total number of cases...
Minh Ha-Duong, Elizabeth Casman, M. Granger Morgan
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
13 years 11 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas
AI
2003
Springer
14 years 26 days ago
Stochastic Local Search for Multiprocessor Scheduling for Minimum Total Tardiness
The multi-processor total tardiness problem (MPTTP) is an ÆÈ-hard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a numb...
Michael Pavlin, Holger H. Hoos, Thomas Stützl...
DISOPT
2007
114views more  DISOPT 2007»
13 years 7 months ago
Bounds for online bounded space hypercube packing
In hypercube packing, we receive a sequence of hypercubes that need to be packed into unit hypercubes which are called bins. Items arrive online and each item must be placed withi...
Leah Epstein, Rob van Stee
CIAC
2010
Springer
262views Algorithms» more  CIAC 2010»
13 years 11 months ago
Graph unique-maximum and conflict-free colorings
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
Panagiotis Cheilaris and Géza Tóth