Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

Voted

JCT
2007

favoriteEmaildiscussreport

62views more JCT 2007»

Integer and fractional packings of hypergraphs

13 years 10 months ago

$Integer and fractional packings of hypergraphs$

Download www.cc.u-ryukyu.ac.jp

Vojtech Rödl, Mathias Schacht, Mark H. Sigger

Real-time Traffic

JCT 2007 |

claim paper

Related Content

» Distributed algorithms for covering packing and maximum weighted matching

» Dynamic Bin Packing of Unit Fractions Items

» On linear and semidefinite programming relaxations for hypergraph matching

» Kernelization of packing problems

» On Dynamic Bin Packing An Improved Lower Bound and Resource Augmentation Analysis

» New approaches to covering and packing problems

» Unbiased Rounding of Rational Matrices

» Witnesses for nonsatisfiability of dense random 3CNF formulas

» Disjoint ColorAvoiding Triangles

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	JCT
Authors	Vojtech Rödl, Mathias Schacht, Mark H. Siggers, Norihide Tokushige

Comments (0)