Takuro Fukunaga

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Bandit Task Assignment with Unknown Processing Time.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022

Approximation algorithm for the 2-stage stochastic matroid base problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2022

Two-level hub Steiner trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2022

Integrality Gap of Time-Indexed Linear Programming Relaxation for Coflow Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2022

Online Task Assignment Problems with Reusable Resources.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Accurate Contention-aware Scheduling Method on Clustered Many-core Platform.

[BibT_eX]

[DOI]

Shingo Igarashi

Takuya Azumi

J. Inf. Process., 2021

A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2020

End-to-End Learning for Prediction and Optimization with Gradient Boosting.

[BibT_eX]

[DOI]

Takuya Konishi

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2020

Accurate Contention Estimate Scheduling Method Using Multiple Clusters of Many-core Platform.

[BibT_eX]

[DOI]

Proceedings of the 28th Euromicro International Conference on Parallel, 2020

Delay and Cooperation in Nonstochastic Linear Bandits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Contention-Free Scheduling for Clustered Many-Core Platform.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Embedded Software and Systems, 2020

2019

Computing a tree having a small vertex cover.

[BibT_eX]

[DOI]

Takanori Maehara

Theor. Comput. Sci., 2019

Submodular Maximization with Uncertain Knapsack Capacity.

[BibT_eX]

[DOI]

Yasushi Kawase

Hanna Sumita

SIAM J. Discret. Math., 2019

LP-based pivoting algorithm for higher-order correlation clustering.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

Improved Regret Bounds for Bandit Combinatorial Optimization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Stochastic Submodular Maximization with Performance-Dependent Item Costs.

[BibT_eX]

[DOI]

Takuya Konishi

Sumio Fujita

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Approximation Algorithms for Highly Connected Multi-dominating Sets in Unit Disk Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2018

Regret Bounds for Online Portfolio Selection with a Cardinality Constraint.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Causal Bandits with Propagating Inference.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Machine Learning, 2018

Boosting PageRank Scores by Optimizing Internal Link Structure.

[BibT_eX]

[DOI]

Proceedings of the Database and Expert Systems Applications, 2018

Online Regression with Partial Information: Generalization and Linear Projection.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017

Spider Covers for Prize-Collecting Network Activation Problem.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

Virtual machine placement for minimizing connection cost in data center networks.

[BibT_eX]

[DOI]

Shuichi Hirahara

Hiyori Yoshikawa

Discret. Optim., 2017

Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Online Optimization of Video-Ad Allocation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Scalable Algorithm for Higher-Order Co-Clustering via Random Sampling.

[BibT_eX]

[DOI]

Daisuke Hatano

Takanori Maehara

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Approximating the Generalized Terminal Backup Problem via Half-Integral Multiflow Relaxation.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Current Trends in Combinatorial Optimization (NII Shonan Meeting 2016-7).

[BibT_eX]

[DOI]

László A. Végh

NII Shonan Meet. Rep., 2016

Covering problems in edge- and node-weighted graphs.

[BibT_eX]

[DOI]

Discret. Optim., 2016

Adaptive Budget Allocation for Maximizing Influence of Advertisements.

[BibT_eX]

[DOI]

Daisuke Hatano

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015

Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design.

[BibT_eX]

[DOI]

Zeev Nutov

SIAM J. Comput., 2015

Constant-approximation algorithms for highly connected multi-dominating sets in unit disk graphs.

[BibT_eX]

[DOI]

CoRR, 2015

Threshold Influence Model for Allocating Advertising Budgets.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Conference on Machine Learning, 2015

Lagrangian Decomposition Algorithm for Allocating Marketing Channels.

[BibT_eX]

[DOI]

Daisuke Hatano

Takanori Maehara

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Unranking of small combinations from large sets.

[BibT_eX]

[DOI]

Toshihiro Shimizu

J. Discrete Algorithms, 2014

Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing Problem.

[BibT_eX]

[DOI]

Afshin Nikzad

Proceedings of the Approximation, 2014

2013

FPTASs for trimming weighted trees.

[BibT_eX]

[DOI]

Mingyu Xiao

Theor. Comput. Sci., 2013

Approximating minimum cost source location problems with local vertex-connectivity demands.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2013

Computing minimum multiway cuts in hypergraphs.

[BibT_eX]

[DOI]

Discret. Optim., 2013

2012

Graph orientations with set connectivity requirements.

[BibT_eX]

[DOI]

Discret. Math., 2012

Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems.

[BibT_eX]

[DOI]

Kazumasa Okumoto

Algorithmica, 2012

Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

An Approximation Algorithm for Locating Maximal Disks within Convex Polygons.

[BibT_eX]

[DOI]

Hirofumi Aota

Int. J. Comput. Geom. Appl., 2011

All 4-Edge-Connected HHD-Free Graphs are \mathbbZ3-Connected.

[BibT_eX]

[DOI]

Graphs Comb., 2011

2010

Network design with weighted degree constraints.

[BibT_eX]

[DOI]

Discret. Optim., 2010

Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

FPTAS's for Some Cut Problems in Weighted Trees.

[BibT_eX]

[DOI]

Mingyu Xiao

Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

2009

Network Design with Edge-Connectivity and Degree Constraints.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2009

Eulerian detachments with local edge-connectivity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

Robust cost colorings.

[BibT_eX]

[DOI]

Magnús M. Halldórsson

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007

Approximability of the capacitated b-edge dominating set problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Approximating a Generalization of Metric TSP.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2007

Generalizing the induced matching by edge capacity constraints.

[BibT_eX]

[DOI]

Discret. Optim., 2007

The Set Connector Problem in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

"Rent-or-Buy" Scheduling and Cost Coloring Problems.

[BibT_eX]

[DOI]

Magnús M. Halldórsson

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006

Some Theorems on Detachments Preserving Local-Edge-Connectivity.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

2005

Approximation Algorithms for the b-Edge Dominating Set Problem and Its Related Problems.

[BibT_eX]

[DOI]