Kiyohito Nagano

Publication Activity (10 Years)

Years Active: 2007-2021
Publications (10 Years): 3

Top Topics

Submodular Functions

Convex Formulation

Cognitive Radio Networks

Top Venues

Publications

Akifumi Kira, Kiyohito Nagano, Manabu Sugiyama, Naoyuki Kamiyama
Optimal class assignment problem: a case study at Gunma University. CoRR (2021)
Kiyohito Nagano, Akihiro Kishimoto
Subadditive Load Balancing. CoRR (2019)
Akihiro Kishimoto, Kiyohito Nagano
Evaluation of Auction-Based Multi-Robot Routing by Parallel Simulation. ICAPS (2016)
Mikio Hasegawa, Hiroshi Hirai, Kiyohito Nagano, Hiroshi Harada, Kazuyuki Aihara
Optimization for Centralized and Decentralized Cognitive Radio Networks. Proc. IEEE 102 (3) (2014)
Kiyohito Nagano, Yoshinobu Kawahara
Structured Convex Optimization under Submodular Constraints. CoRR (2013)
Kiyohito Nagano, Yoshinobu Kawahara
Structured Convex Optimization under Submodular Constraints. UAI (2013)
Daiki Suehiro, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Kiyohito Nagano
Online Prediction under Submodular Constraints. ALT (2012)
Yoshinobu Kawahara, Kiyohito Nagano, Yoshio Okamoto
Submodular fractional programming for balanced clustering. Pattern Recognit. Lett. 32 (2) (2011)
Kiyohito Nagano, Yoshinobu Kawahara, Kazuyuki Aihara
Size-constrained Submodular Minimization through Minimum Norm Base. ICML (2011)
Kiyohito Nagano, Yoshinobu Kawahara, Satoru Iwata
Minimum Average Cost Clustering. NIPS (2010)
Satoru Fujishige, Takumi Hayashi, Kiyohito Nagano
Minimizing Continuous Extensions of Discrete Convex Functions with Linear Inequality Constraints. SIAM J. Optim. 20 (2) (2009)
Satoru Fujishige, Kiyohito Nagano
A Structure Theory for the Parametric Submodular Intersection Problem. Math. Oper. Res. 34 (3) (2009)
Yoshinobu Kawahara, Kiyohito Nagano, Koji Tsuda, Jeff A. Bilmes
Submodularity Cuts and Applications. NIPS (2009)
Satoru Iwata, Kiyohito Nagano
Submodular Function Minimization under Covering Constraints. FOCS (2009)
Fabián A. Chudak, Kiyohito Nagano
Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization. SODA (2007)
Kiyohito Nagano
A strongly polynomial algorithm for line search in submodular polyhedra. Discret. Optim. 4 (3-4) (2007)
Kiyohito Nagano
On Convex Minimization over Base Polytopes. IPCO (2007)