A monthly overview of things you need to know as an architect or aspiring architect. Unlock the full InfoQ experience by logging in! Stay updated with your favorite authors and topics, engage with ...

The Traveling Salesman Problem (TSP) is a prototypical NP-hard combinatorial optimisation challenge: given a set of locations and pairwise distances satisfying the triangle inequality, find the ...

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.

In computer science, the research area of algorithms investigates formal procedures for solving computational problems, emphasizing correctness, efficiency, and resource optimization. It encompasses ...