The following pages link to Maiko Shigeno (Q294750):
Displaying 27 items.
- A fast cost scaling algorithm for submodular flow (Q294751) (← links)
- A cost-scaling algorithm for \(0-1\) submodular flows (Q678855) (← links)
- A comment on pure-strategy Nash equilibria in competitive diffusion games (Q763492) (← links)
- A new parameter for a broadcast algorithm with locally bounded Byzantine faults (Q763544) (← links)
- Pure-strategy Nash equilibria on competitive diffusion games (Q1752579) (← links)
- An algorithm for fractional assignment problems (Q1842662) (← links)
- Fast cycle canceling algorithms for minimum cost submodular flow (Q1882113) (← links)
- A dual approximation approach to weighted matroid intersection (Q1919181) (← links)
- On the number of edges in a minimum \(C_6\)-saturated graph (Q2354620) (← links)
- Non-adaptive group testing on graphs with connectivity (Q2424809) (← links)
- Maximum network flows with concave gains (Q2492702) (← links)
- Strongly separable matrices for nonadaptive combinatorial group testing (Q2659071) (← links)
- Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow (Q2757624) (← links)
- Minimax inverse problems of minimum cuts (Q2782726) (← links)
- Approximation algorithms for a winner determination problem of single-item multi-unit auctions (Q2843172) (← links)
- AN ADJUSTABLE ROBUST APPROACH FOR A 1-MEDIAN LOCATION PROBLEM ON A TREE (Q3535159) (← links)
- (Q4250177) (← links)
- (Q4263717) (← links)
- (Q4367277) (← links)
- A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences (Q4385162) (← links)
- Cancel-and-tighten algorithm for quickest flow problems (Q4565782) (← links)
- A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS(<Special Issue>Network Design, Control and Optimization) (Q4671021) (← links)
- Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization (Q4785876) (← links)
- (Q4935243) (← links)
- (Q4995273) (← links)
- New bounds on the minimum number of calls in failure‐tolerant gossiping (Q5191126) (← links)
- A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow (Q5470761) (← links)
