42 search results - page 2 / 9 » Linear And Hereditary Discrepancy |
SWAT
1994
Springer
13 years 9 months ago
1994
Springer
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
COMBINATORICA
2004
13 years 4 months ago
2004
Let p [1, [ and cp = maxa[0,1]((1 - a)ap + a(1 - a)p)1/p. We prove that the known upper bound lindiscp(A) cp for the Lp linear discrepancy of a totally unimodular matrix A is as...
DM
2010
13 years 5 months ago
2010
DM
2011
12 years 12 months ago
2011
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...