The following pages link to Akiyoshi Shioura (Q170013):
Displayed 30 items.
- (Q4548801) (← links)
- ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS (Q4596997) (← links)
- (Q4703087) (← links)
- (Q4761946) (← links)
- (Q4952722) (← links)
- (Q5012285) (← links)
- M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System (Q5085152) (← links)
- Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints (Q5131701) (← links)
- (Q5208430) (← links)
- Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints (Q5245021) (← links)
- EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH (Q5285185) (← links)
- A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines (Q5300489) (← links)
- A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions (Q5323056) (← links)
- On Equivalence of M$^\natural$-concavity of a Set Function and Submodularity of Its Conjugate (Q5376368) (← links)
- (Q5462186) (← links)
- EFFICIENT STRATEGY PROOF FAIR ALLOCATION ALGORITHMS (Q5490363) (← links)
- GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY (Q5500266) (← links)
- A Unified View to Greedy Geometric Routing Algorithms in Ad Hoc Networks (Q5507394) (← links)
- On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem (Q5704180) (← links)
- Algorithmic Applications in Management (Q5710129) (← links)
- Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra (Q5891686) (← links)
- Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra (Q5893990) (← links)
- Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks (Q5929137) (← links)
- Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella. (Q5954245) (← links)
- Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines (Q6166913) (← links)
- Characterization and algorithm for bivariate multi-unit assignment valuations (Q6179926) (← links)
- Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques (Q6196891) (← links)
- M-convex Function Minimization Under L1-Distance Constraint (Q6306467) (← links)
- Note on Minimization of Quasi M$^\natural$-convex Functions (Q6438288) (← links)
- Note on Steepest Descent Algorithm for Quasi L$^{\natural}$-convex Function Minimization (Q6444631) (← links)