Results 1  10
of
12
Approximations of Weighted Independent Set and Hereditary Subset Problems
 JOURNAL OF GRAPH ALGORITHMS AND APPLICATIONS
, 2000
"... The focus of this study is to clarify the approximability of weighted versions of the maximum independent set problem. In particular, we report improved performance ratios in boundeddegree graphs, inductive graphs, and general graphs, as well as for the unweighted problem in sparse graphs. Wher ..."
Abstract

Cited by 71 (6 self)
 Add to MetaCart
. Where possible, the techniques are applied to related hereditary subgraph and subset problem, obtaining ratios better than previously reported for e.g. Weighted Set Packing, Longest Common Subsequence, and Independent Set in hypergraphs.
Approximations of Independent Set Variants and Hereditary Subset Problems
, 1999
"... The focus of this study is to clarify the approximability of the important versions of the maximum independent set problem, and to apply, where possible, the technique to related hereditary subgraph and subset problem. We report improved performance ratios for the Independent Set problem in weighted ..."
Abstract
 Add to MetaCart
The focus of this study is to clarify the approximability of the important versions of the maximum independent set problem, and to apply, where possible, the technique to related hereditary subgraph and subset problem. We report improved performance ratios for the Independent Set problem
Approximations via partitioning
 Japan Advanced Inst. of Sci. and Tech
, 1995
"... We consider the approximation of weighted maximum subgraph problems by partitioning the input graph into easier subproblems. In particular, we obtain efficient approximations of the weighted independent set problem with performance ratios of O(n(log log n / log n) 2) and ( ∆ + 2)/3, with the latter ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
We consider the approximation of weighted maximum subgraph problems by partitioning the input graph into easier subproblems. In particular, we obtain efficient approximations of the weighted independent set problem with performance ratios of O(n(log log n / log n) 2) and ( ∆ + 2)/3, with the latter
On the Linear and Hereditary Discrepancies
"... We exhibit a set system S 0 such that any set system containing it has linear discrepancy at least 2. Let V be a finite set and S ` 2 V a system of subsets of V . The incidence matrix A of (V; S) has rows indexed by the sets of S and the columns indexed by the points of V . The column correspond ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We exhibit a set system S 0 such that any set system containing it has linear discrepancy at least 2. Let V be a finite set and S ` 2 V a system of subsets of V . The incidence matrix A of (V; S) has rows indexed by the sets of S and the columns indexed by the points of V . The column
Identifying codes in hereditary classes of graphs and VCdimension
, 2014
"... An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbours within the code. We show a dichotomy for the size of the smallest identifying code in classes of graphs closed under induced subgraphs. Our dichotomy is ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
in the number of vertices while classes with finite VCdimension have a polynomial lower bound. We then turn to approximation algorithms. We show that Min Id Code (the problem of finding a smallest identifying code in a given graph from some class C) is logAPXhard for any hereditary class of infinite VC
Lower Bounds for Online Graph Problems with Application to Online Circuit and Optical Routing
, 1996
"... We present lower bounds on the competitive ratio of randomized algorithms for a wide class of online graph optimization problems and we apply such results to online virtual circuit and optical routing problems. Lund and Yannakakis [LY93a] give inapproximability results for the problem of finding t ..."
Abstract

Cited by 45 (8 self)
 Add to MetaCart
the largest vertex induced subgraph satisfying any nontrivial, hereditary, property . E.g., independent set, planar, acyclic, bipartite, etc. We consider the online version of this family of problems, where some graph G is fixed and some subgraph H is presented online, vertex by vertex. The on
Complexity Results for Equistable Graphs and Related Classes
, 2009
"... We describe a simple pseudopolynomialtime dynamic programming algorithm to solve the maximum weight stable set problem along with the weighted independent domination problem in some classes of graphs, including equistable graphs. These classes, not contained in any nontrivial hereditary class, are ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We describe a simple pseudopolynomialtime dynamic programming algorithm to solve the maximum weight stable set problem along with the weighted independent domination problem in some classes of graphs, including equistable graphs. These classes, not contained in any nontrivial hereditary class
GRAPHS WITH MAXIMAL INDUCED MATCHINGS OF THE SAME SIZE
, 2011
"... A graph is wellindumatched if all its maximal (with respect to set inclusion) induced matchings are of the same size. We first prove that recognizing the classWIM of wellindumatched graphs is a coNPcomplete problem even for (2P5,K1,5)free graphs. We then show that the wellknown decision probl ..."
Abstract
 Add to MetaCart
problems such as Independent Dominating Set, Independent Set, and Dominating Set are NPcomplete for wellindumatched graphs. We also show thatWIM is a coindumatching hereditary class and characterize wellindumatched graphs in terms of forbidden coindumatching subgraphs. However, we prove
2 NONMONOTONE BARZILAIBORWEIN GRADIENT ALGORITHM FOR ℓ1REGULARIZED NONSMOOTH MINIMIZATION IN COMPRESSIVE SENSING
"... ar ..."
The evaluation of genetic parameters of the type of calving in the population of holstein friesian cow
, 2013
"... Genetic parameters (heritability coefficients and genetic correlations) of the type of calving, number of stillbirths and birth weight have been evaluated in the population of Holstein Friesian cattle breed. Data sets have been analysed by means of the Mixed Least Square Model (LSMLMW). Besides a r ..."
Abstract
 Add to MetaCart
who studied this problem we can see that approximate values for direct heritability of the type of calving were obtained also by The number of stillbirths varied under the influence of hereditary base in the range of 1.8%, (h 2 = 0.018±0.006) what also points to the dominant effect
Results 1  10
of
12