Graph theory: An algorithmic approach (Computer science and applied mathematics)
Graph theory: An algorithmic approach (Computer science and applied mathematics)
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
Counting Subgraphs via Homomorphisms
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Invitation to algorithmic uses of inclusion-exclusion
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
A cost-efficient self-configurable BIST technique for testing multiplexer-based FPGA interconnect
Journal of Electronic Testing: Theory and Applications
The traveling salesman problem in bounded degree graphs
ACM Transactions on Algorithms (TALG)
Fast hamiltonicity checking via bases of perfect matchings
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
A new deterministic approach to the (assymetric) Traveling Salesman Problem based on generating functions is introduced. Specifically, we produce a function G(x)&equil;&Sgr;&agr;ix ei where each ei is the cost of a possible tour and &agr;i is the number of tours having this cost. Evaluating G(x) at a specific value close to O and using a logarithmic technique, we extract the smallest exponent, i.e., the minimal tour cost. For an n city problem the method requires on the order of n32n steps and storage for n2 values (possibly of high precision). This technique should be applicable to other “NP” problems.