Back to Results
First PageMeta Content
NP-complete problems / Combinatorics / Analysis of algorithms / Set packing / Randomized algorithm / Disjoint-set data structure / Parameterized complexity / Set cover problem / Dominating set / Theoretical computer science / Computational complexity theory / Mathematics


A faster parameterized algorithm for set packing Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA
Add to Reading List

Document Date: 2011-03-02 23:58:37

Open Document

File Size: 114,77 KB

Share Result on Facebook

Company

W. H. Freeman & Co. / /

Currency

pence / /

/

Facility

Ioannis Koutis Computer Science Department Carnegie Mellon University / /

IndustryTerm

parameterized algorithm / faster parameterized algorithm / deterministic algorithm / decision algorithm / computing / /

Organization

Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh / /

Person

Noga Alon / Uri Zwick / David S. Johnson / Gary L. Miller / Raphael Yuster / Michael R. Garey / Hudson / Ioannis Koutis / /

/

Technology

J. Algorithms / 3 The algorithm / 2.1 The decision algorithm / randomized algorithm / following algorithm / faster parameterized algorithm / /

SocialTag