Chen, Q. (CSE) – New Approximation and Online Algorithms using Novel Combinatorial Structures
E2-553Most optimization problems face the challenge of computing an optimum solution requiring superpolynomial time. In particular, they are classified as NP-hard problems that have no polynomial-time algorithm to date. Instead, […]