653 search results - page 40 / 131 » The size of minimum 3-trees |
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that th...
103
click to vote
WADS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5k kn2 ). The algor...
CCCG
2008
15 years 1 months ago
2008
We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...
ANOR
2002
14 years 11 months ago
2002
Abstract: We define events so as to reduce the number of events and decision variables needed for modeling batchscheduling problems such as described in [Westenberger and Kallrath ...
DCC
2002
IEEE
15 years 11 months ago
2002
IEEE
Let finite source and reproduction alphabets X and Y and a distortion measure d : X ? Y [0, ) be given. We study the minimum asymptotic rate required to describe a source distrib...