| Document Date: 2013-10-09 05:34:13
Open Document File Size: 312,34 KBShare Result on Facebook
/ Facility Czech Technical University / / IndustryTerm vacuum systems / likely social network / machinery / reconfigurable interconnection networks / Search tree algorithms / fixed-parameter algorithms / polynomial-time algorithms / overlay networks / search tree / logarithmic-factor approximation algorithms / partial solution / / Organization Czech Technical University in Prague / Institut f¨ / Department of Theoretical Computer Science / / Person F. Unless / / ProgrammingLanguage D / / PublishedMedium Theoretical Computer Science / / Technology logarithmic-factor approximation algorithms / fixed-parameter algorithms / Search tree algorithms / branching algorithm / polynomial-time algorithms / time algorithm / /
SocialTag |
Effective and Efficient Data Reduction for the Subset Interconnection Design Problem? Jiehua Chen1 , Christian Komusiewicz1 , Rolf Niedermeier1 , Manuel Sorge1 , Ondˇrej Such´ y2 , and Mathias Weller3 1