A note on minimum-dummy-activities PERT networks
Marian Mrozek (1984)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Displaying similar documents to “More on the tournament equilibrium set”
A note on minimum-dummy-activities PERT networks
On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem
Sounaka Mishra, Kripasindhu Sikdar (2001)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We study hardness of approximating several minimaximal and maximinimal NP-optimization problems related to the minimum linear ordering problem (MINLOP). MINLOP is to find a minimum weight acyclic tournament in a given arc-weighted complete digraph. MINLOP is APX-hard but its unweighted version is polynomial time solvable. We prove that MIN-MAX-SUBDAG problem, which is a generalization of MINLOP and requires to find a minimum cardinality maximal acyclic subdigraph of a given digraph,...
Generalized uniformly line vulnerable digraphs
Peter Horák (1982)
Časopis pro pěstování matematiky
Similarity:
-minimal subsets of the circle
Dusa McDuff (1981)
Annales de l'institut Fourier
Similarity:
Necessary conditions are found for a Cantor subset of the circle to be minimal for some -diffeomorphism. These conditions are not satisfied by the usual ternary Cantor set.
Covers of digraphs
Willibald Dörfler, Frank Harary, Günther Malle (1980)
Mathematica Slovaca
Similarity:
On (4, 2)-digraphs containing a cycle of length 2.
Iswadi, Hazrul, Baskoro, Edy Tri (2000)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem
Sounaka Mishra, Kripasindhu Sikdar (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
We study hardness of approximating several minimaximal and maximinimal NP-optimization problems related to the minimum linear ordering problem (MINLOP). MINLOP is to find a minimum weight acyclic tournament in a given arc-weighted complete digraph. MINLOP is APX-hard but its unweighted version is polynomial time solvable. We prove that MIN-MAX-SUBDAG problem, which is a generalization of MINLOP and requires to find a minimum cardinality maximal acyclic subdigraph of a given digraph,...