Combinatorial Algorithms

  title={Combinatorial Algorithms},
  author={Alexander Souza},
  booktitle={Lecture Notes in Computer Science},
  • A. Souza
  • Published in
    Lecture Notes in Computer…
  • Mathematics
s of Invited Talks BWT Variants: A Combinatorial Investigation 


Fundamentals of domination in graphs
Bounds on the domination number domination, independence and irredundance efficiency, redundancy and the duals changing and unchanging domination conditions on the dominating set varieties of
A note on maximizing a submodular set function subject to a knapsack constraint
Maximum Domination Problem
It is proved that, for any constant e > 0, there is no polynomial time 1303/1304+e approximation algorithm for k-MaxED unless P = NP, and if k is not larger than the size of the minimum maximal matching, k- MaxED is 3/4-approximable in polynometric time.
The Superman problem
A Θ (n logn) algorithm that finds the minimum number of edges, ofP that the authors want to retain in order to hidek froms if the visibility polygon ofs givenK is unbounded, is shown to run in linear time.
Minus domination in graphs
Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm
This paper presents a fast and surprisingly simple algorithm that exhibits the following features: (1) when applied to trees, cycles, or complete graphs, it always produces an optimal solution (i.e, a minimum size target set); (2) when applications to arbitrary networks, itAlways produces a solution of cardinality which improves on previously known upper bounds.
Graphs with Forbidden and Required Vertices
Une instance du probleme est un graphe, un ensemble F de sommets interdits et un ensemble R de sommets obligatoires. Nous montrons que construire un vertex cover, connexe ou pas, de taille minimale,
An analysis of approximations for maximizing submodular set functions—I
It is shown that a “greedy” heuristic always produces a solution whose value is at least 1 −[(K − 1/K]K times the optimal value, which can be achieved for eachK and has a limiting value of (e − 1)/e, where e is the base of the natural logarithm.
Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
It is shown, assuming the exponential time hypothesis (ETH), that there is no polynomial-time algorithm that approximates Densest k-Subgraph to within n1/(loglogn)c factor of the optimum, where c > 0 is a universal constant independent of n.