On the public citation graph
Improved Approximation Bounds for Edge Dominating Set in Dense Graphs
0 signed · 36 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11533719_71openalex-snapshot
A Tight Analysis of the Maximal Matching Heuristic
inferredcites →https://doi.org/10.1007/s00453-007-9057-yopenalex-snapshot
Linear Time Algorithms for Generalized Edge Dominating Set Problems
inferredcites →https://doi.org/10.1007/s10878-006-7908-0openalex-snapshot
Approximation hardness of edge dominating set problems
inferredcites →https://doi.org/10.1016/0020-0190(95)94093-8openalex-snapshot
Edge domination on bipartite permutation graphs and cotriangulated graphs
inferredcites →https://doi.org/10.1016/j.dam.2007.09.005openalex-snapshot
Facet defining inequalities among graph invariants: The system GraPHedron
inferredcites →https://doi.org/10.1016/j.tcs.2007.06.009openalex-snapshot
Approximability of the capacitated b -edge dominating set problem
inferredcites →https://doi.org/10.1016/s0166-218x(00)00383-8openalex-snapshot
A 2-approximation algorithm for the minimum weight edge dominating set problem
inferredcites →https://doi.org/10.1023/a:1011445210568openalex-snapshot
A $${{10}}$$ -Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem
inferredcites →https://doi.org/10.1090/dimacs/040/11openalex-snapshot
Approximating dense cases of covering problems
inferredcites →https://doi.org/10.1137/s0097539700381097openalex-snapshot
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_4openalex-snapshot
Connected Vertex Covers in Dense Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-93980-1_21openalex-snapshot
A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-17461-2_13openalex-snapshot
An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-20877-5_5openalex-snapshot
Approximating Edge Dominating Set in Dense Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_54openalex-snapshot
New Parameterized Algorithms for the Edge Dominating Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_5openalex-snapshot
New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set
inferred← citeshttps://doi.org/10.1007/s00224-014-9549-5openalex-snapshot
New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set
inferred← citeshttps://doi.org/10.1007/s10878-012-9499-2openalex-snapshot
Improved approximation for spanning star forest in dense graphs
inferred← citeshttps://doi.org/10.1007/s11590-011-0351-xopenalex-snapshot
Integer programming formulations for the minimum weighted maximal matching problem
inferred← citeshttps://doi.org/10.1016/j.dam.2007.09.005openalex-snapshot
Facet defining inequalities among graph invariants: The system GraPHedron
inferred← citeshttps://doi.org/10.1016/j.dam.2013.06.014openalex-snapshot
On the k -edge-incident subgraph problem and its variants
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112243openalex-snapshot
Bounding and approximating minimum maximal matchings in regular graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.03.021openalex-snapshot
Connected vertex covers in dense graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.10.001openalex-snapshot
Approximating edge dominating set in dense graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.06.022openalex-snapshot
New parameterized algorithms for the edge dominating set problem
inferred← citeshttps://doi.org/10.1080/00207160.2013.853052openalex-snapshot
Hardness and approximation of minimum maximal matchings
inferred← citeshttps://doi.org/10.1080/10556788.2015.1104679openalex-snapshot
Maximal matching polytope in trees
inferred← citeshttps://doi.org/10.1142/s0218348x21502091openalex-snapshot
EDGE DOMINATION NUMBER AND THE NUMBER OF MINIMUM EDGE DOMINATING SETS IN PSEUDOFRACTAL SCALE-FREE WEB AND SIERPIŃSKI GASKET
inferred← citeshttps://doi.org/10.37094/adyujsci.540858openalex-snapshot
Valid Inequalities for the Maximal Matching Polytope
inferred← citeshttps://doi.org/10.37236/9963openalex-snapshot
Minimum Maximal Matchings in Cubic Graphs
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2015.361openalex-snapshot
A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2019.36openalex-snapshot
On Kernelization for Edge Dominating Set under Structural Parameters
inferred← citeshttps://doi.org/10.46298/dmtcs.5378openalex-snapshot
New Results on Directed Edge Dominating Set
inferred← citeshttps://doi.org/10.48550/arxiv.1104.4160openalex-snapshot
New parameterized algorithms for edge dominating set
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.