Takuro Fukunaga

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 44

Top Topics

Approximation Algorithms

Integrality Gap

Top Venues

SIAM J. Discret. Math.

Publications

Koji Ichikawa, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem. AAAI (2024)
Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Bandit Task Assignment with Unknown Processing Time. NeurIPS (2023)
Koji Ichikawa, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
New classes of the greedy-applicable arm feature distributions in the sparse linear bandit problem. CoRR (2023)
Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Online Task Assignment Problems with Reusable Resources. AAAI (2022)
Takuro Fukunaga
Integrality Gap of Time-Indexed Linear Programming Relaxation for Coflow Scheduling. APPROX/RANDOM (2022)
Takuro Fukunaga, R. Ravi, Oleksandr Rudenko, Ziye Tang
Approximation algorithm for the 2-stage stochastic matroid base problem. Oper. Res. Lett. 50 (2) (2022)
Takuro Fukunaga, R. Ravi, Oleksandr Rudenko, Ziye Tang
Two-level hub Steiner trees. Inf. Process. Lett. 174 (2022)
Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Online Task Assignment Problems with Reusable Resources. CoRR (2022)
Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. CoRR (2021)
Shingo Igarashi, Takuro Fukunaga, Takuya Azumi
Accurate Contention-aware Scheduling Method on Clustered Many-core Platform. J. Inf. Process. 29 (2021)
Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits. AISTATS (2021)
Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. AAAI (2021)
Takuro Fukunaga
Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs. IEEE/ACM Trans. Netw. 28 (1) (2020)
Ryotaro Koike, Takuro Fukunaga, Shingo Igarashi, Takuya Azumi
Contention-Free Scheduling for Clustered Many-Core Platform. ICESS (2020)
Takuya Konishi, Takuro Fukunaga
End-to-End Learning for Prediction and Optimization with Gradient Boosting. ECML/PKDD (3) (2020)
Shingo Igarashi, Yuto Kitagawa, Takuro Fukunaga, Takuya Azumi
Accurate Contention Estimate Scheduling Method Using Multiple Clusters of Many-core Platform. PDP (2020)
Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Delay and Cooperation in Nonstochastic Linear Bandits. NeurIPS (2020)
Takuro Fukunaga, Takuya Konishi, Sumio Fujita, Ken-ichi Kawarabayashi
Stochastic Submodular Maximization with Performance-Dependent Item Costs. AAAI (2019)
Takuro Fukunaga
Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs. CoRR (2019)
Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback. NeurIPS (2019)
Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Improved Regret Bounds for Bandit Combinatorial Optimization. NeurIPS (2019)
Takuro Fukunaga
LP-based pivoting algorithm for higher-order correlation clustering. J. Comb. Optim. 37 (4) (2019)
Yasushi Kawase, Hanna Sumita, Takuro Fukunaga
Submodular Maximization with Uncertain Knapsack Capacity. SIAM J. Discret. Math. 33 (3) (2019)
Takuro Fukunaga, Takanori Maehara
Computing a tree having a small vertex cover. Theor. Comput. Sci. 791 (2019)
Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi
Causal Bandits with Propagating Inference. ICML (2018)
Yasushi Kawase, Hanna Sumita, Takuro Fukunaga
Submodular Maximization with Uncertain Knapsack Capacity. LATIN (2018)
Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Regret Bounds for Online Portfolio Selection with a Cardinality Constraint. NeurIPS (2018)
Takuro Fukunaga
LP-Based Pivoting Algorithm for Higher-Order Correlation Clustering. COCOON (2018)
Takuro Fukunaga
Approximation Algorithms for Highly Connected Multi-dominating Sets in Unit Disk Graphs. Algorithmica 80 (11) (2018)
Yasushi Kawase, Hanna Sumita, Takuro Fukunaga
Submodular maximization with uncertain knapsack capacity. CoRR (2018)
Naoto Ohsaka, Tomohiro Sonobe, Naonori Kakimura, Takuro Fukunaga, Sumio Fujita, Ken-ichi Kawarabayashi
Boosting PageRank Scores by Optimizing Internal Link Structure. DEXA (1) (2018)
Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Online Regression with Partial Information: Generalization and Linear Projection. AISTATS (2018)
Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi
Causal Bandits with Propagating Inference. CoRR (2018)
Takuro Fukunaga, Shuichi Hirahara, Hiyori Yoshikawa
Virtual machine placement for minimizing connection cost in data center networks. Discret. Optim. 26 (2017)
Daisuke Hatano, Takuro Fukunaga, Takanori Maehara, Ken-ichi Kawarabayashi
Scalable Algorithm for Higher-Order Co-Clustering via Random Sampling. AAAI (2017)
Takuro Fukunaga
Spider Covers for Prize-Collecting Network Activation Problem. ACM Trans. Algorithms 13 (4) (2017)
Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation. NIPS (2017)
Hanna Sumita, Yasushi Kawase, Sumio Fujita, Takuro Fukunaga
Online Optimization of Video-Ad Allocation. IJCAI (2017)
Takuro Fukunaga, Takanori Maehara
Computing a tree having a small vertex cover. CoRR (2017)
Daisuke Hatano, Takuro Fukunaga, Ken-ichi Kawarabayashi
Adaptive Budget Allocation for Maximizing Influence of Advertisements. IJCAI (2016)
Takuro Fukunaga, Takanori Maehara
Computing a Tree Having a Small Vertex Cover. COCOA (2016)
Takuro Fukunaga
Approximating the Generalized Terminal Backup Problem via Half-Integral Multiflow Relaxation. SIAM J. Discret. Math. 30 (2) (2016)
Takuro Fukunaga, R. Ravi, László A. Végh
Current Trends in Combinatorial Optimization (NII Shonan Meeting 2016-7). NII Shonan Meet. Rep. 2016 (2016)
Takuro Fukunaga
Covering problems in edge- and node-weighted graphs. Discret. Optim. 20 (2016)
Atsushi Miyauchi, Yuni Iwamasa, Takuro Fukunaga, Naonori Kakimura
Threshold Influence Model for Allocating Advertising Budgets. ICML (2015)
Takuro Fukunaga, Shuichi Hirahara, Hiyori Yoshikawa
Virtual machine placement for minimizing connection cost in data center networks. INFOCOM Workshops (2015)
Takuro Fukunaga, Zeev Nutov, R. Ravi
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design. SIAM J. Comput. 44 (5) (2015)
Takuro Fukunaga
Spider covers for prize-collecting network activation problem. SODA (2015)
Takuro Fukunaga
Constant-approximation algorithms for highly connected multi-dominating sets in unit disk graphs. CoRR (2015)
Daisuke Hatano, Takuro Fukunaga, Takanori Maehara, Ken-ichi Kawarabayashi
Lagrangian Decomposition Algorithm for Allocating Marketing Channels. AAAI (2015)
Takuro Fukunaga
Approximating the Generalized Terminal Backup Problem via Half-integral Multiflow Relaxation. STACS (2015)
Toshihiro Shimizu, Takuro Fukunaga, Hiroshi Nagamochi
Unranking of small combinations from large sets. J. Discrete Algorithms 29 (2014)
Takuro Fukunaga
Approximating the generalized terminal backup problem via half-integral multiflow relaxation. CoRR (2014)
Takuro Fukunaga
Covering Problems in Edge- and Node-Weighted Graphs. SWAT (2014)
Takuro Fukunaga, Afshin Nikzad, R. Ravi
Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing Problem. APPROX-RANDOM (2014)
Takuro Fukunaga
Covering problems in edge- and node-weighted graphs. CoRR (2014)
Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi
FPTASs for trimming weighted trees. Theor. Comput. Sci. 469 (2013)
Takuro Fukunaga
Spider covers for prize-collecting network activation problem. CoRR (2013)
Takuro Fukunaga
Approximating minimum cost source location problems with local vertex-connectivity demands. J. Discrete Algorithms 19 (2013)
Takuro Fukunaga
Computing minimum multiway cuts in hypergraphs. Discret. Optim. 10 (4) (2013)
Takuro Fukunaga
Graph orientations with set connectivity requirements. Discret. Math. 312 (15) (2012)
Takuro Fukunaga, R. Ravi
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design. FOCS (2012)
Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems. Algorithmica 62 (3-4) (2012)
Takuro Fukunaga, R. Ravi
Iterative rounding approximation algorithms for degree-bounded node-connectivity network design CoRR (2012)
Hirofumi Aota, Takuro Fukunaga, Hiroshi Nagamochi
An Approximation Algorithm for Locating Maximal Disks within Convex Polygons. Int. J. Comput. Geom. Appl. 21 (6) (2011)
Takuro Fukunaga
Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands. TAMC (2011)
Takuro Fukunaga
-Connected. Graphs Comb. 27 (5) (2011)
Takuro Fukunaga, Hiroshi Nagamochi
Network design with weighted degree constraints. Discret. Optim. 7 (4) (2010)
Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi
FPTAS's for Some Cut Problems in Weighted Trees. FAW (2010)
Takuro Fukunaga
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings. IPCO (2010)
Takuro Fukunaga
Graph Orientations with Set Connectivity Requirements. ISAAC (2009)
Takuro Fukunaga, Hiroshi Nagamochi
Network Design with Weighted Degree Constraints. WALCOM (2009)
Takuro Fukunaga, Hiroshi Nagamochi
Network Design with Edge-Connectivity and Degree Constraints. Theory Comput. Syst. 45 (3) (2009)
Takuro Fukunaga, Hiroshi Nagamochi
Eulerian detachments with local edge-connectivity. Discret. Appl. Math. 157 (4) (2009)
Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems. ISAAC (2009)
Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi
Robust cost colorings. SODA (2008)
André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh
Approximability of the capacitated b-edge dominating set problem. Theor. Comput. Sci. 385 (1-3) (2007)
Takuro Fukunaga, Hiroshi Nagamochi
Generalizing the induced matching by edge capacity constraints. Discret. Optim. 4 (2) (2007)
Takuro Fukunaga, Hiroshi Nagamochi
The Set Connector Problem in Graphs. IPCO (2007)
Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi
"Rent-or-Buy" Scheduling and Cost Coloring Problems. FSTTCS (2007)
Takuro Fukunaga, Hiroshi Nagamochi
Approximating a Generalization of Metric TSP. IEICE Trans. Inf. Syst. (2) (2007)
Takuro Fukunaga, Hiroshi Nagamochi
Network Design with Edge-Connectivity and Degree Constraints. WAOA (2006)
Takuro Fukunaga, Hiroshi Nagamochi
Some Theorems on Detachments Preserving Local-Edge-Connectivity. Electron. Notes Discret. Math. 24 (2006)
Takuro Fukunaga, Hiroshi Nagamochi
-Edge Dominating Set Problem and Its Related Problems. COCOON (2005)