On the public citation graph

Approximating maximum independent sets in uniform hypergraphs

https://doi.org/10.1007/bfb0055806
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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01581168openalex-snapshot
Approximating the independence number via theϑ-function
inferredcites →https://doi.org/10.1007/bf01994876openalex-snapshot
Approximating maximum independent sets by excluding subgraphs
inferredcites →https://doi.org/10.1007/bf02523693openalex-snapshot
Greed is good: Approximating independent sets in sparse and bounded-degree graphs
inferredcites →https://doi.org/10.1016/0012-365x(72)90084-2openalex-snapshot
Turán's theorem for k-graphs
inferredcites →https://doi.org/10.1016/0020-0190(92)90228-nopenalex-snapshot
An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3
inferredcites →https://doi.org/10.1016/0020-0190(93)90246-6openalex-snapshot
A still better performance guarantee for approximate graph coloring
inferredcites →https://doi.org/10.1016/0196-6774(86)90019-2openalex-snapshot
A fast and simple randomized parallel algorithm for the maximal independent set problem
inferredcites →https://doi.org/10.1016/s0020-0190(96)00190-1openalex-snapshot
An algorithm for 3-colorable graphs
inferredcites →https://doi.org/10.1017/cbo9780511814075openalex-snapshot
Randomized Algorithms
inferredcites →https://doi.org/10.1109/ccc.1996.507690openalex-snapshot
Zero knowledge and the chromatic number
inferredcites →https://doi.org/10.1109/sfcs.1994.365710openalex-snapshot
Approximate graph coloring by semidefinite programming
inferredcites →https://doi.org/10.1109/sfcs.1996.548522openalex-snapshot
Clique is hard to approximate within n/sup 1-ε/
inferredcites →https://doi.org/10.1112/plms/s3-2.1.417openalex-snapshot
Combinatorial Theorems on Classifications of Subsets of a Given Set
inferredcites →https://doi.org/10.1137/0406036openalex-snapshot
An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size
inferredcites →https://doi.org/10.1145/129712.129745openalex-snapshot
On the parallel complexity of computing a maximal independent set in a hypergraph
inferredcites →https://doi.org/10.1145/195058.195221openalex-snapshot
Greed is good
inferredcites →https://doi.org/10.1145/2157.2158openalex-snapshot
Improving the performance guarantee for approximate graph coloring
inferredcites →https://doi.org/10.1145/274787.274791openalex-snapshot
Approximate graph coloring by semidefinite programming

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jagm.2001.1173openalex-snapshot
Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1007/11537311_3openalex-snapshot
Path Coupling Using Stopping Times
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_26openalex-snapshot
Approximations of Weighted Independent Set and Hereditary Subset Problems
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_38openalex-snapshot
Independent Sets in Semi-random Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-48413-4_3openalex-snapshot
Independent Sets in Hypergraphs with Applications to Routing Via Fixed Paths
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_24openalex-snapshot
Independent Sets in Bounded-Degree Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-74835-9_12openalex-snapshot
Fragmentation and Encryption to Enforce Privacy in Data Storage
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_44openalex-snapshot
Approximating Independent Set and Coloring in Random Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1007/bfb0055753openalex-snapshot
Mathematical Foundations of Computer Science 1998
inferred← citeshttps://doi.org/10.1016/j.dam.2008.11.013openalex-snapshot
Independent sets in bounded-degree hypergraphs
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00077-4openalex-snapshot
Approximate coloring of uniform hypergraphs
inferred← citeshttps://doi.org/10.1145/1805974.1805978openalex-snapshot
Combining fragmentation and encryption to protect privacy in data storage
inferred← citeshttps://doi.org/10.1145/3664283openalex-snapshot
Automated Category Tree Construction: Hardness Bounds and Algorithms
inferred← citeshttps://doi.org/10.1145/846241.846250openalex-snapshot
Incentive compatible multi unit combinatorial auctions
inferred← citeshttps://doi.org/10.2478/ausi-2014-0022openalex-snapshot
On vertex independence number of uniform hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.math/0501081openalex-snapshot
Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs
inferred← citeshttps://doi.org/10.7155/jgaa.00020openalex-snapshot
Approximations of Weighted Independent Set and Hereditary Subset Problems
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.