Author image not provided
 Toshihiro Fujito

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article7.50
Citation Count255
Publication count34
Publication years1993-2016
Available for download2
Average downloads per article109.50
Downloads (cumulative)219
Downloads (12 Months)17
Downloads (6 Weeks)3
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


34 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 34
Result page: 1 2

Sort by:

1
June 2016 CSR 2016: Proceedings of the 11th International Computer Science Symposium on Computer Science --- Theory and Applications - Volume 9691
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

The edge dominating set problem EDS is to compute a minimum edge set such that every edge is dominated by some edge in it. This paper considers a variant of EDS with extensions of multiple and connected dominations combined. In the b-EDS problem, each edge needs to be dominated b ...

2
February 2016 Algorithmica: Volume 74 Issue 2, February 2016
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We present a greedy algorithm for the directed Steiner tree problem (DST), where any tree rooted at any (uncovered) terminal can be a candidate for greedy choice. It will be shown that the algorithm, running in polynomial time for any constant $$l$$l, outputs a directed Steiner tree of cost no ...
Keywords: Approximation algorithms, Directed graphs, Greedy algorithm, Steiner tree problem, Tree cover problem

3
February 2016 Journal of Combinatorial Optimization: Volume 31 Issue 2, February 2016
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

The multislope ski-rental problem is an extension of the classical ski-rental problem, where the player has several lease options besides the pure rent and buy options. In this problem the hardness of an instance, which is the setting of options, significantly affects the player's performance. There is an algorithm that ...
Keywords: Competitive analysis, Mathematical programming, Online algorithm, Online optimization, Ski-rental problem

4
September 2013 Information Processing Letters: Volume 113 Issue 19-21, September, 2013
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 0

This paper shows that the optimization problem arising from the guarding game played between the cop and robber players on an undirected graph can be approximated in polynomial time within a factor of @Q(logn) when the robber moves along a tree.
Keywords: Greedy approximation, Set cover, Approximation algorithms, Guarding game

5
June 2012 WG'12: Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We present a greedy algorithm for the directed Steiner tree problem (DST), where any tree rooted at any (uncovered) terminal can be a candidate for greedy choice. It will be shown that the algorithm, running in polynomial time for any constant l , outputs a directed Steiner tree of cost ...

6 published by ACM
April 2012 ACM Transactions on Algorithms (TALG): Volume 8 Issue 2, April 2012
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 2,   Downloads (12 Months): 15,   Downloads (Overall): 211

Full text available: PDFPDF
The minimum cost-tree cover problem is to compute a minimum cost-tree T in a given connected graph G with costs on the edges, such that the vertices spanned by T form a vertex cover for G . The problem is supposed to occur in applications of vertex cover and in ...
Keywords: primal-dual method, local ratio technique, Approximation algorithms, tree cover

7
January 2012 CATS '12: Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Publisher: Australian Computer Society, Inc.
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 2,   Downloads (Overall): 8

Full text available: PDFPDF
This paper shows that the optimization problem arising from the guarding game played between the cop and robber players on an undirected graph can be approximated within a factor of Θ(log n ) when the robber region is a tree.
Keywords: greedy approximation, guarding game, set cover

8
December 2011 ISAAC'11: Proceedings of the 22nd international conference on Algorithms and Computation
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3

The multislope ski-rental problem [11] is an extension of the classical ski-rental problem [10], where the player has several <em>lease</em> options in addition to the pure <em>rent</em> and <em>buy</em> options. In this problem an <em>instance</em>, which is the setting of the options, significantly affects the player's performance. There is an ...

9
June 2009 ISAAC '01: Proceedings of the 12th International Symposium on Algorithms and Computation
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

The set cover problem is that of computing, given a family of weighted subsets of a base set U , a minimum weight subfamily F� such that every element of U is covered by some subset in F� . The k -set cover problem is a variant in which every ...

10
September 2006 Discrete Optimization: Volume 3 Issue 3, September, 2006
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

The tree cover (TC) problem is to compute a minimum weight connected edge set, given a connected and edge-weighted graph G, such that its vertex set forms a vertex cover for G. Unlike related problems of vertex cover or edge dominating set, weighted TC is not yet known to be ...
Keywords: Tree cover, Primal-dual method, Approximation algorithms

11
July 2006 ICALP'06: Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 8

The minimum cost tree cover problem is to compute a minimum cost tree T in a given connected graph G with costs on the edges, such that the vertices of T form a vertex cover for G . The problem is supposed to arise in applications of vertex cover and ...

12
June 2006 Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003): Volume 154 Issue 9, 1 June 2006
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

The set cover problem is that of computing a minimum weight subfamily F' given a family F of weighted subsets of a base set U , such that every element of U is covered by some subset in F'. The k -set cover problem is a variant in which every ...
Keywords: primal-dual method, approximation algorithms, greedy algorithm, set cover

13
June 2006 Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003): Volume 154 Issue 9, 1 June 2006
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

The set cover problem is that of computing a minimum weight subfamily F^', given a family F of weighted subsets of a base set U, such that every element of U is covered by some subset in F^'. The k-set cover problem is a variant in which every subset is ...
Keywords: Primal-dual method, Set cover, Approximation algorithms, Greedy algorithm

14
October 2005 WAOA'05: Proceedings of the Third international conference on Approximation and Online Algorithms
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

The set multicover (MC) problem is a natural extension of the set cover problem s.t. each element requires to be covered a prescribed number of times (instead of just once as in set cover). The k -set multicover ( k -MC) problem is a variant in which every subset is ...

15
September 2004 WAOA'04: Proceedings of the Second international conference on Approximation and Online Algorithms
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

Suppose there are a set of suppliers i and a set of consumers j with demands b j , and the amount of products that can be shipped from i to j is at most c ij . The amount of products that a supplier i can produce is an ...

16
April 2004 Information Processing Letters: Volume 90 Issue 2, 30 April 2004
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 4

The connected vertex cover problem is a variant of the vertex cover problem, in which a vertex cover is additional required to induce a connected subgraph in a given connected graph. The problem is known to be NP-hard and to be at least as hard to approximate as the vertex ...
Keywords: approximation algorithms, connected vertex cover, parallel algorithms, tree cover

17
May 2002 Discrete Applied Mathematics: Volume 118 Issue 3, May 15, 2002
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 31

Keywords: LP relaxation, approximation algorithm, edge dominating set problem

18
December 2001 ISAAC '01: Proceedings of the 12th International Symposium on Algorithms and Computation
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

The set cover problem is that of computing, given a family of weighted subsets of a base set U , a minimum weight subfamily F ′ such that every element of U is covered by some subset in F ′. The k -set cover problem is a variant in which ...

19
September 2001 Information Processing Letters: Volume 79 Issue 6, September 30, 2001
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 13

Keywords: combinatorial optimization problems, edge dominating set, approximation algorithms

20
December 2000 FST TCS 2000: Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We investigate polynomial-time approximability of the problems related to edge dominating sets of graphs. When edges are unit-weighted, the edge dominating set problem is polynomially equivalent to the minimum maximal matching problem, in either exact or approximate computation, and the former problem was recently found to be approximable within a ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us