<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2008-01-16 15:03:23NP-complete problems Combinatorial optimization Spanning tree Steiner tree problem Graph Tree Connectivity Shortest path problem Matching Graph theory Mathematics Theoretical computer science |
Add to Reading List |
10 TH IEEE I NTERNATIONAL C ONFERERNCE ON C OMPUTER V ISION (ICCV 2005), O CTOBER 17–20, 2005, B EIJING , C HINA . Finding Tree Structures by Grouping Symmetries Hiroshi Ishikawa† [removed] †![arXiv:1807.01672v2 [cs.LG] 6 JulRanked Reward: Enabling Self-Play Reinforcement Learning for Combinatorial Optimization Alexandre Laterre](https://www.pdfsearch.io/img/fc82b7913ca0093fe7c1f22778317c8f.jpg "arXiv:1807.01672v2 [cs.LG] 6 JulRanked Reward: Enabling Self-Play Reinforcement Learning for Combinatorial Optimization Alexandre Laterre")
![Research Summary∗ Chandra Nair Overview In my early research career I considered random versions of combinatorial optimization problems; my doctoral thesis [17] resolved a long-standing conjecture about the assignment](https://www.pdfsearch.io/img/869aefdb3eda27cbac49899f24e2c699.jpg "Research Summary∗ Chandra Nair Overview In my early research career I considered random versions of combinatorial optimization problems; my doctoral thesis [17] resolved a long-standing conjecture about the assignment")
