Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2768313
Jump to:navigation, search

zbMath0999.05039MaRDI QIDQ2768313

Michael Krivelevich, Ram Nathaniel, Benjamin Sudakov

Publication date: 24 March 2002


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

hypergraphsindependent setapproximation algorithms


Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25)


Related Items (5)

Path coupling using stopping times and counting independent sets and colorings in hypergraphs ⋮ Testing hypergraph colorability ⋮ Convex Relaxations and Integrality Gaps ⋮ Wireless capacity with arbitrary gain matrix ⋮ Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2768313&oldid=15647372"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 14:31.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki