{"id":43,"date":"2023-07-24T11:11:06","date_gmt":"2023-07-24T11:11:06","guid":{"rendered":"http:\/\/acolab.ie.nthu.edu.tw\/summeralgor\/?page_id=43"},"modified":"2023-10-11T10:01:18","modified_gmt":"2023-10-11T10:01:18","slug":"program","status":"publish","type":"page","link":"https:\/\/acolab.ee.ntu.edu.tw\/summeralgor\/index.php\/program\/","title":{"rendered":"Program"},"content":{"rendered":"
Friday, September 8, 2023<\/strong><\/h5>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\n
Session<\/td>\nTime<\/td>\nTitle<\/td>\n<\/tr>\n
<\/td>\n10:00-10:30<\/td>\nRegistration<\/strong><\/td>\n<\/tr>\n
[Tutorial Session]<\/td>\n10:30-11:10<\/td>\nAn Introduction of Burrows-Wheeler Transform (BWT) and Its Variants
\nWing-Kai Hon<\/strong><\/td>\n<\/tr>\n
11:10-11:50<\/td>\nMultiagent Learning for Approximating Equilibria in Games
\nPo-An Chen<\/strong><\/td>\n<\/tr>\n
<\/td>\n12:00-14:00<\/td>\nLunch<\/strong><\/td>\n<\/tr>\n
[Session A]
\nAlgorithms and Complexity I<\/td>\n		14:00-14:30<\/td>\nTransportation Problems on a Graph with and without Integer Property
\nTetsuo Asano<\/strong><\/td>\n<\/tr>\n
14:40-15:10<\/td>\n\u0393-graphic delta-matroids and their applications on variants of maximum spanning tree problems
\nSang-il Oum<\/strong><\/td>\n<\/tr>\n
15:20-15:50<\/td>\nIntroduction to Secure Computation
\nKunihiko Sadakane<\/strong><\/td>\n<\/tr>\n
<\/td>\n15:50-16:10<\/td>\nTea Break<\/strong><\/td>\n<\/tr>\n
[Session B]
\nAlgorithms and Complexity II<\/td>\n		16:10-16:40<\/td>\nRecent progress on Min. Description Size Problems (MDSP)
\nOsamu Watanabe<\/strong><\/td>\n<\/tr>\n
16:50-17:20<\/td>\nA Scalable Algorithm for Inferring Phylogenetic Networks from Trees
\nLouxin Zhang<\/strong><\/td>\n<\/tr>\n
17:30-18:00<\/td>\nRate-independent computation in chemical reaction networks
\nHo-Lin Chen<\/strong><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 
\n 
\n <\/p>\n

Saturday, September 9, 2023<\/strong><\/h5>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\n
Session<\/td>\nTime<\/td>\nTitle<\/td>\n<\/tr>\n
<\/td>\n09:30-09:40<\/td>\nRegistration<\/strong><\/td>\n<\/tr>\n
[Session C]
\nAlgorithms and Complexity III<\/td>\n		09:40-10:10<\/td>\nOptimal Composition Ordering for 1-Variable Functions
\nKazuhisa Makino<\/strong><\/td>\n<\/tr>\n
10:20-10:50<\/td>\nRanking Vectors to Optimize Nondecreasingness
\nTakeshi Tokuyama<\/strong><\/td>\n<\/tr>\n
11:00-11:30<\/td>\nOn the Complexity of Approximate Stationarity Concepts in Non-Smooth Optimization
\nAnthony Man-Cho So<\/strong><\/td>\n<\/tr>\n
<\/td>\n12:00-14:00<\/td>\nLunch<\/strong><\/td>\n<\/tr>\n
[Session D]
\nOptimization I<\/td>\n		14:00-14:30<\/td>\n Approximation Algorithms for Multi-Market Competitive Facility Location Problem with Endogenous Demand and Diminishing Marginal Effect
\n Ling-Chieh Kung <\/strong><\/td>\n<\/tr>\n
14:40-15:10<\/td>\n Approximability of Some Network Design Optimization Problems
\n Ling-Ju Hung <\/strong><\/td>\n<\/tr>\n
15:20-15:50<\/td>\n On the integrality gap of MFN relaxation for Capacitated Facility Location Problem
\n Mong-Jen Kao <\/strong><\/td>\n<\/tr>\n
<\/td>\n15:50-16:10<\/td>\nTea Break<\/strong><\/td>\n<\/tr>\n
[Session E]
\nOptimization II<\/td>\n		16:10-16:40<\/td>\n Online portfolio selection and online learning quantum states
\n Yen-Huan Li <\/strong><\/td>\n<\/tr>\n
16:50-17:20<\/td>\n Exact Methods on a Class of Robust Submodular Maximization Problems
\n Hao-Hsiang Wu <\/strong><\/td>\n<\/tr>\n
17:30-18:00<\/td>\nAn Introduction to the Variational Inequality Problem and Its Algorithms
\nKevin Dowhon Huang<\/strong><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 
\n 
\n <\/p>\n

Sunday, September 10, 2023<\/strong><\/h5>\n\n\n\n\n\n\n\n\n
\n
Session<\/td>\nTime<\/td>\nTitle<\/td>\n<\/tr>\n
[Discussion Session I]<\/td>\n10:00-12:00<\/td>\nRecent Research Trends on Operations research and Algorithms<\/td>\n<\/tr>\n
<\/td>\n12:00-14:00<\/td>\nLunch<\/strong><\/td>\n<\/tr>\n
[Discussion Session II]<\/td>\n14:00-16:00<\/td>\nFuture Research Trends on Operations research and Algorithms<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n","protected":false},"excerpt":{"rendered":"

Friday, September 8, 2023 Session Time Title 09:30-09:40 Registration [Session C] Algorithms and Complexity III 09:40-10:10 Optimal Composition Ordering for 1-Variable Functions Kazuhisa Makino 10:20-10:50 Ranking Vectors to Optimize Nondecreasingness Takeshi Tokuyama 11:00-11:30 On the Complexity of Approximate Stationarity Concepts in Non-Smooth Optimization Anthony Man-Cho So 12:00-14:00 Lunch [Session D] Optimization I 14:00-14:30 Approximation Algorithms […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":3,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/acolab.ee.ntu.edu.tw\/summeralgor\/index.php\/wp-json\/wp\/v2\/pages\/43"}],"collection":[{"href":"https:\/\/acolab.ee.ntu.edu.tw\/summeralgor\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/acolab.ee.ntu.edu.tw\/summeralgor\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/acolab.ee.ntu.edu.tw\/summeralgor\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/acolab.ee.ntu.edu.tw\/summeralgor\/index.php\/wp-json\/wp\/v2\/comments?post=43"}],"version-history":[{"count":54,"href":"https:\/\/acolab.ee.ntu.edu.tw\/summeralgor\/index.php\/wp-json\/wp\/v2\/pages\/43\/revisions"}],"predecessor-version":[{"id":280,"href":"https:\/\/acolab.ee.ntu.edu.tw\/summeralgor\/index.php\/wp-json\/wp\/v2\/pages\/43\/revisions\/280"}],"wp:attachment":[{"href":"https:\/\/acolab.ee.ntu.edu.tw\/summeralgor\/index.php\/wp-json\/wp\/v2\/media?parent=43"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}