scientific article; zbMATH DE number 1947044

zbMATH Open1013.90119MaRDI QIDQ4411274FDOQ4411274

Authors: Nitin Ahuja, Anand Srivastav 

Publication date: 7 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2462/24620014.htm

Title of this publication is not available (Why is that?)

Recommendations

• Approximate hypergraph coloring
• Approximate coloring of uniform hypergraphs
• scientific article; zbMATH DE number 1305101
• Approximate constrained bipartite edge coloring
• scientific article; zbMATH DE number 1002208

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Cited In (9)

• Deterministic Hypergraph Coloring and Its Applications
• Title not available (Why is that?)
• “Rent-or-Buy” Scheduling and Cost Coloring Problems
• Resource-sharing systems and hypergraph colorings
• Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
• Color-bounded hypergraphs, IV: Stable colorings of hypertrees
• Mixed hypergraphs and beyond
• Extensions of coloring models for scheduling purposes
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411274)