Sciweavers

1215 search results - page 150 / 243
» Combinatorics
Sort
View
COCOON
2009
Springer
15 years 1 months ago
An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
Given a sequencing of jobs on a single machine, each one with a weight, processing time, and a due date, the tardiness of a job is the time needed for its completion beyond its du...
George Karakostas, Stavros G. Kolliopoulos, Jing W...
185
Voted
CPM
2010
Springer
145views Combinatorics» more  CPM 2010»
14 years 10 months ago
Succinct Representations of Separable Graphs
Abstract. We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In p...
Guy E. Blelloch, Arash Farzan
324
Voted
CPM
2011
Springer
402views Combinatorics» more  CPM 2011»
14 years 7 months ago
Tractability Results for the Consecutive-Ones Property with Multiplicity
A binary matrix has the Consecutive-Ones Property (C1P) if its columns can be ordered in such a way that all 1’s in each row are consecutive. We consider here a variant of the C1...
Cedric Chauve, Ján Manuch, Murray Patterson...
COCOON
2001
Springer
15 years 8 months ago
Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws
abstract appeared in: Proc. of 7th Ann. Int. Computing and Combinatorics Conference, COCOON 2001 (ed. J. Wang), Lecture Notes in Computer Science Vol. 2108, Springer-Verlag, Berlin...
Iain A. Stewart
COMBINATORICS
2006
162views more  COMBINATORICS 2006»
15 years 3 months ago
Bounding the Partition Function of Spin-Systems
With a graph G = (V, E) we associate a collection of non-negative real weights vV {i,v : 1 i m} uvE{ij,uv : 1 i j m}. We consider the probability distribution on {f : V {1,...
David J. Galvin