Toshihiro Fujito

Inf. Process. Lett., 2023

Approximating Power Node-Deletion Problems.

[BibT_eX]

[DOI]

Kneto Mukae

Junya Tsuzuki

Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

2021

On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem.

[BibT_eX]

[DOI]

Takumi Tatematsu

Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021

2020

Eternal Connected Vertex Cover Problem.

[BibT_eX]

[DOI]

Tomoya Nakamura

Proceedings of the Theory and Applications of Models of Computation, 2020

2019

Approximating Partially Bounded Degree Deletion on Directed Graphs.

[BibT_eX]

[DOI]

Kei Kimura

Yuki Mizuno

J. Graph Algorithms Appl., 2019

2018

On Approximating (Connected) 2-Edge Dominating Set by a Tree.

[BibT_eX]

[DOI]

Tomoaki Shimoda

Theory Comput. Syst., 2018

The Fewest Clues Problem of Picross 3D.

[BibT_eX]

[DOI]

Kei Kimura

Takuya Kamehashi

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017

On Approximability of Connected Path Vertex Cover.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

Approximating Bounded Degree Deletion via Matroid Matching.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

On the best possible competitive ratio for the multislope ski-rental problem.

[BibT_eX]

[DOI]

Takuma Kitano

J. Comb. Optim., 2016

Competitive Analysis for the 3-Slope Ski-Rental Problem with the Discount Rate.

[BibT_eX]

[DOI]

Shunsuke Satou

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

Online Weight Balancing on the Unit Circle.

[BibT_eX]

[DOI]

Takahiro Seki

IEICE Trans. Inf. Syst., 2016

Competitive Analysis for the Flat-Rate Problem.

[BibT_eX]

[DOI]

Atsushi Matsuda

IEICE Trans. Inf. Syst., 2016

Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications.

[BibT_eX]

[DOI]

Tomoya Hibi

Algorithmica, 2016

Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers.

[BibT_eX]

[DOI]

Daichi Suzuki

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

2015

The Huffman Tree Problem with Unit Step Functions.

[BibT_eX]

[DOI]

Takuya Nakamura

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

On the Eternal Vertex Cover Numbers of Generalized Trees.

[BibT_eX]

[DOI]

Hisashi Araki

Shota Inoue

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

2014

Analysis of Lower Bounds for the Multislope Ski-Rental Problem.

[BibT_eX]

[DOI]

Yasuhiro Konno

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory - SWAT 2014, 2014

2013

How to guard a graph against tree moves.

[BibT_eX]

[DOI]

Takayoshi Sakamaki

Inf. Process. Lett., 2013

2012

How to trim a MST: A 2-Approximation algorithm for minimum cost-tree cover.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

How to guard a graph against tree movements.

[BibT_eX]

[DOI]

Takayoshi Sakamaki

Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

2011

On the Best Possible Competitive Ratio for Multislope Ski Rental.

[BibT_eX]

[DOI]

Takuma Kitano

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2009

Foreword.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

2006

A modified greedy algorithm for dispersively weighted 3-set cover.

[BibT_eX]

[DOI]

Tsuyoshi Okumura

Discret. Appl. Math., 2006

How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

A Better-Than-Greedy Algorithm for <i>k</i>-Set Multicover.

[BibT_eX]

[DOI]

Hidekazu Kurahashi

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

2004

On Combinatorial Approximation of Covering 0-1 Integer Programs and Partial Set Cover.

[BibT_eX]

[DOI]

J. Comb. Optim., 2004

A 2-approximation NC algorithm for connected vertex cover and tree cover.

[BibT_eX]

[DOI]

Takashi Doi

Inf. Process. Lett., 2004

A Primal-Dual Method for Approximating Tree Cover with Two Weights.

[BibT_eX]

[DOI]

Takashi Doi

Electron. Notes Discret. Math., 2004

Submodular Integer Cover and Its Application to Production Planning.

[BibT_eX]

[DOI]

Takatoshi Yabuta

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

2002

Approximating Polymatroid Packing and Covering.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

A 2-approximation algorithm for the minimum weight edge dominating set problem.

[BibT_eX]

[DOI]

Hiroshi Nagamochi

Discret. Appl. Math., 2002

2001

A 2\frac{1}{10}-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2001

On approximability of the independent/connected edge dominating set problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2.

[BibT_eX]

[DOI]

Tsuyoshi Okumura

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000

Approximating minimum feedback vertex sets in hypergraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2000

1999

A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem.

[BibT_eX]

[DOI]

Vineet Bafna

SIAM J. Discret. Math., 1999

On approximation of the submodular set cover problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1999

On Approximation Properties of the Independent Set Problem for Low Degree Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 1999

Approximating Node-Deletion Problems for Matroidal Properties.

[BibT_eX]

[DOI]

J. Algorithms, 1999

1998

A Unified Approximation Algorithm for Node-deletion Problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

1997

A Primal-Dual Approach to Approximation of Node-Deletion Problems for Matroidal Properties.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

A Note on Approximation of the Vertex Cover and Feedback Vertex Set Problems - Unified Approach.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

A Unified Local Ratio Approximation of Node-Deletion Problems (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1996

1995

On the Approximation Properties of Independent Set Problem in Degree 3 Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs.

[BibT_eX]

[DOI]

Vineet Bafna

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1993

A 2or3-Approximation of the Matroid Matching Problem.

[BibT_eX]

[DOI]