The following pages link to Takuro Fukunaga (Q429669):
Displaying 45 items.
- Network design with weighted degree constraints (Q429670) (← links)
- Graph orientations with set connectivity requirements (Q442326) (← links)
- Unranking of small combinations from large sets (Q473209) (← links)
- All 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connected (Q659731) (← links)
- Network design with edge-connectivity and degree constraints (Q839639) (← links)
- Eulerian detachments with local edge-connectivity (Q1028462) (← links)
- Covering problems in edge- and node-weighted graphs (Q1751155) (← links)
- Virtual machine placement for minimizing connection cost in data center networks (Q1751257) (← links)
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) (← links)
- Computing minimum multiway cuts in hypergraphs (Q1799394) (← links)
- FPTASs for trimming weighted trees (Q1935805) (← links)
- Two-level hub Steiner trees (Q2059893) (← links)
- Computing a tree having a small vertex cover (Q2272400) (← links)
- Submodular maximization with uncertain knapsack capacity (Q2294723) (← links)
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems (Q2428700) (← links)
- Approximating minimum cost source location problems with local vertex-connectivity demands (Q2434929) (← links)
- Approximability of the capacitated \(b\)-edge dominating set problem (Q2456372) (← links)
- Generalizing the induced matching by edge capacity constraints (Q2467130) (← links)
- Approximation algorithm for the 2-stage stochastic matroid base problem (Q2670486) (← links)
- Approximating the Generalized Terminal Backup Problem via Half-Integral Multiflow Relaxation (Q2804546) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- (Q2955005) (← links)
- Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem (Q2969619) (← links)
- (Q2999651) (← links)
- Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands (Q3010423) (← links)
- Some Theorems on Detachments Preserving Local-Edge-Connectivity (Q3439432) (← links)
- Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings (Q3569805) (← links)
- (Q3579461) (← links)
- FPTAS’s for Some Cut Problems in Weighted Trees (Q3587352) (← links)
- Network Design with Weighted Degree Constraints (Q3605498) (← links)
- Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems (Q3652191) (← links)
- Graph Orientations with Set Connectivity Requirements (Q3652212) (← links)
- Spider Covers for Prize-Collecting Network Activation Problem (Q4554939) (← links)
- AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS (Q4650086) (← links)
- Spider Covering Algorithms for Network Design Problems (Q4689626) (← links)
- (Q4995276) (← links)
- Submodular Maximization with Uncertain Knapsack Capacity (Q5232144) (← links)
- Spider covers for prize-collecting network activation problem (Q5363079) (← links)
- APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385038) (← links)
- The Set Connector Problem in Graphs (Q5429288) (← links)
- Network Design with Edge-Connectivity and Degree Constraints (Q5443519) (← links)
- “Rent-or-Buy” Scheduling and Cost Coloring Problems (Q5458824) (← links)
- Computing and Combinatorics (Q5716997) (← links)
- LP-based pivoting algorithm for higher-order correlation clustering (Q5916248) (← links)
- LP-based pivoting algorithm for higher-order correlation clustering (Q5920230) (← links)
