A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the ...

Abstract: The cost-distance Steiner tree problem seeks a Steiner tree that minimizes the total congestion cost plus the weighted sum of sourcesink delays. This problem arises as a subroutine in timing ...

Welcome to my 281 archive! This notes include implementations of basic data structures: union-find sets, unordered_map by hash table, AVL tree, graph represented by adjacency matrix&list and a lot ...

You can create a release to package software, along with release notes and links to binary files, for other people to use. Learn more about releases in our docs.