Takuro Fukunaga

Available identifiers

zbMath Open fukunaga.takuroMaRDI QIDQ429669

List of research outcomes

Publication	Date of Publication	Type
Approximation algorithm for the 2-stage stochastic matroid base problem	2022-03-11	Paper
Two-level hub Steiner trees	2021-12-14	Paper
https://portal.mardi4nfdi.de/entity/Q4995276	2021-06-23	Paper
Submodular maximization with uncertain knapsack capacity	2020-02-12	Paper
Computing a tree having a small vertex cover	2019-09-10	Paper
Submodular Maximization with Uncertain Knapsack Capacity	2019-08-29	Paper
LP-based pivoting algorithm for higher-order correlation clustering	2019-06-25	Paper
Approximation algorithms for highly connected multi-dominating sets in unit disk graphs	2019-01-11	Paper
Spider Covers for Prize-Collecting Network Activation Problem	2018-11-12	Paper
Computing minimum multiway cuts in hypergraphs	2018-10-18	Paper
Spider Covering Algorithms for Network Design Problems	2018-10-16	Paper
LP-based pivoting algorithm for higher-order correlation clustering	2018-10-04	Paper
Covering problems in edge- and node-weighted graphs	2018-05-24	Paper
Virtual machine placement for minimizing connection cost in data center networks	2018-05-24	Paper
Spider covers for prize-collecting network activation problem	2017-10-05	Paper
https://portal.mardi4nfdi.de/entity/Q2969619	2017-03-22	Paper
Computing a tree having a small vertex cover	2017-02-01	Paper
https://portal.mardi4nfdi.de/entity/Q2955005	2017-01-24	Paper
Approximating the Generalized Terminal Backup Problem via Half-Integral Multiflow Relaxation	2016-04-29	Paper
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design	2015-10-08	Paper
Unranking of small combinations from large sets	2014-11-24	Paper
Covering problems in edge- and node-weighted graphs	2014-09-02	Paper
Approximating minimum cost source location problems with local vertex-connectivity demands	2014-02-03	Paper
FPTASs for trimming weighted trees	2013-02-19	Paper
AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS	2012-11-23	Paper
Graph orientations with set connectivity requirements	2012-08-10	Paper
Network design with weighted degree constraints	2012-06-20	Paper
Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems	2012-04-26	Paper
All 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connected	2012-01-24	Paper
Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands	2011-07-01	Paper
https://portal.mardi4nfdi.de/entity/Q2999651	2011-05-16	Paper
FPTAS’s for Some Cut Problems in Weighted Trees	2010-09-07	Paper
https://portal.mardi4nfdi.de/entity/Q3579461	2010-08-06	Paper
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings	2010-06-22	Paper
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems	2009-12-17	Paper
Graph Orientations with Set Connectivity Requirements	2009-12-17	Paper
Network design with edge-connectivity and degree constraints	2009-09-02	Paper
Eulerian detachments with local edge-connectivity	2009-06-30	Paper
Network Design with Weighted Degree Constraints	2009-02-24	Paper
APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)	2008-04-29	Paper
“Rent-or-Buy” Scheduling and Cost Coloring Problems	2008-04-24	Paper
Network Design with Edge-Connectivity and Degree Constraints	2008-02-21	Paper
Generalizing the induced matching by edge capacity constraints	2008-01-18	Paper
The Set Connector Problem in Graphs	2007-11-29	Paper
Approximability of the capacitated \(b\)-edge dominating set problem	2007-10-18	Paper
Some Theorems on Detachments Preserving Local-Edge-Connectivity	2007-05-29	Paper
Computing and Combinatorics	2006-01-11	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Takuro Fukunaga