The following pages link to Toshihiro Fujito (Q222488):
Displaying 48 items.
- Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265) (← links)
- A note on approximation of the vertex cover and feedback vertex set problems -- Unified approach (Q671377) (← links)
- A unified approximation algorithm for node-deletion problems (Q1270821) (← links)
- On approximation properties of the independent set problem for low degree graphs (Q1281930) (← links)
- Approximating minimum feedback vertex sets in hypergraphs (Q1583598) (← links)
- A 2-approximation algorithm for the minimum weight edge dominating set problem (Q1602689) (← links)
- On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
- Approximating partially bounded degree deletion on directed graphs (Q1641092) (← links)
- On approximability of connected path vertex cover (Q1644919) (← links)
- On combinatorial approximation of covering 0-1 integer programs and partial set cover (Q1777420) (← links)
- On approximation of the submodular set cover problem (Q1969763) (← links)
- On \(b\)-matchings and \(b\)-edge dominating sets: a 2-approximation algorithm for the 4-edge dominating set problem (Q2085737) (← links)
- A note on approximations of directed edge dominating set (Q2094379) (← links)
- Eternal connected vertex cover problem (Q2110709) (← links)
- A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219) (← links)
- How to guard a graph against tree moves (Q2445266) (← links)
- A primal-dual method for approximating tree cover with two weights (Q2465937) (← links)
- A modified greedy algorithm for dispersively weighted 3-set cover (Q2492216) (← links)
- (Q2753930) (← links)
- Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
- Online Weight Balancing on the Unit Circle (Q2945664) (← links)
- On the Best Possible Competitive Ratio for Multislope Ski Rental (Q3104654) (← links)
- On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem (Q3188895) (← links)
- How to trim a MST (Q3189057) (← links)
- The Fewest Clues Problem of Picross 3D (Q3301015) (← links)
- A Primal-Dual Method for Approximating Tree Cover with Two Weights (Q3439142) (← links)
- How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover (Q3613779) (← links)
- Approximating Node-Deletion Problems for Matroidal Properties (Q4240133) (← links)
- (Q4268441) (← links)
- (Q4472438) (← links)
- (Q4474132) (← links)
- A primal-dual approach to approximation of node-deletion problems for matroidal properties (Q4572003) (← links)
- A unified local ratio approximation of node-deletion problems (Q4595485) (← links)
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem (Q4699157) (← links)
- (Q4761859) (← links)
- On approximation properties of the Independent set problem for degree 3 graphs (Q5057456) (← links)
- Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications (Q5200508) (← links)
- Approximating Partially Bounded Degree Deletion on Directed Graphs (Q5240368) (← links)
- Approximating Bounded Degree Deletion via Matroid Matching (Q5283370) (← links)
- Approximation and Online Algorithms (Q5713434) (← links)
- On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)
- Approximation and Online Algorithms (Q5898472) (← links)
- A \(2\frac{1}{10}\)-approximation algorithm for a generalization of the weighted edge-dominating set problem (Q5952320) (← links)
- On the best possible competitive ratio for the multislope ski-rental problem (Q5963633) (← links)
- Approximating power node-deletion problems (Q6057334) (← links)
- Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs (Q6487955) (← links)
- Approximating power node-deletion problems (Q6593676) (← links)
