5 search results - page 1 / 1 » Finding a Nonempty Algebraic Subset of an Edge Set in Linear... |
JGAA
2007
13 years 4 months ago
2007
SIAMCOMP
2002
13 years 4 months ago
2002
Given an edge-weighted graph where all weights are nonnegative reals, an edge reweighting is an assignment of nonnegative reals to edges such that, for each vertex, the sums of giv...
APPROX
2005
Springer
13 years 10 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
ICCI
1991
13 years 8 months ago
1991
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...