Improved Algorithms for Weighted and Unweighted Set Splitting Problems

DOI10.1007/978-3-540-73545-8_52zbMATH Open1213.68696OpenAlexW1517594962MaRDI QIDQ3608877FDOQ3608877

Jianer Chen, Songjian Lu

Publication date: 6 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_52

Recommendations

• Improved parameterized set splitting algorithms: A Probabilistic approach
• Even faster algorithm for set splitting!
• Graph-Theoretic Concepts in Computer Science
• Improved Parameterized Algorithms for Weighted 3-Set Packing
• Parameterized algorithms for weighted matching and packing problems

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Randomized algorithms (68W20) Nonnumerical algorithms (68W05)

Cited In (4)

• Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters
• Improved parameterized set splitting algorithms: A Probabilistic approach
• Even faster algorithm for set splitting!
• Improved algorithmic results for unsplittable stable allocation problems

Uses Software

• Outward rotations

This page was built for publication: Improved Algorithms for Weighted and Unweighted Set Splitting Problems

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