COCOON 2009 - PDF Preprint Papers

COCOON 2009 International Conference on Computing and Combinatorics

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed COCOON-2009 Paper

click to vote

COCOON
2009
Springer

176views Combinatorics» more COCOON 2009»

An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates

13 years 10 months ago

Download cgi.di.uoa.gr

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...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	176	An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates	claim
2	162	On the Readability of Monotone Boolean Formulae	claim
3	155	Convex Recoloring Revisited: Complexity and Exact Algorithms	claim
4	154	Convex Partitions with 2-Edge Connected Dual Graphs	claim
5	153	On the Performances of Nash Equilibria in Isolation Games	claim
6	143	Sublinear-Time Algorithms for Tournament Graphs	claim
7	141	Approximation Algorithms for Key Management in Secure Multicast	claim
8	141	Online Tree Node Assignment with Resource Augmentation	claim
9	141	Computing Bond Types in Molecule Graphs	claim
10	140	HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank	claim
11	140	Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem	claim
12	139	An Improved Time-Space Lower Bound for Tautologies	claim
13	138	Limits to List Decoding Random Codes	claim
14	135	On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries	claim
15	133	Determination of Glycan Structure from Tandem Mass Spectra	claim
16	130	Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection	claim
17	129	Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone	claim
18	125	Three New Algorithms for Regular Language Enumeration	claim
19	120	Separating NE from Some Nonuniform Nondeterministic Complexity Classes	claim
20	119	Edge-Intersection Graphs of k-Bend Paths in Grids	claim
21	117	A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise	claim
22	113	On Finding Small 2-Generating Sets	claim
23	111	Popular Matchings: Structure and Algorithms	claim
24	106	Hierarchies and Characterizations of Stateless Multicounter Machines	claim
25	103	On Smoothed Analysis of Quicksort and Hoare's Find	claim
26	102	An Attacker-Defender Game for Honeynets	claim
27	96	A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions	claim
28	94	On the Generalised Character Compatibility Problem for Non-branching Character Trees	claim
29	94	Graph-Based Data Clustering with Overlaps	claim
30	91	Coordinate Assignment for Cyclic Level Graphs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers