Google Research

New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs

28th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl, Leibniz-Center for Informatics GmbH, Dagstuhl Publishing, Saarbrücken/Wadern, Germany (2011), pp. 519-530

Abstract

No abstract available; check out the Download or Google Scholar links above for publications details.

Learn more about how we do research

We maintain a portfolio of research projects, providing individuals and teams the freedom to emphasize specific types of work