On the public citation graph

An $O(\Sqrt{K})$-Approximation Algorithm for \\ Minimum Power K Edge Disjoint St-Paths

0 signed · 17 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/978-3-319-04298-5_7openalex-extracted

Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth

inferredcites →https://doi.org/10.1007/978-3-540-69507-3_35openalex-extracted

Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks

inferredcites →https://doi.org/10.1007/978-3-642-38233-8_1openalex-extracted

Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost

inferredcites →https://doi.org/10.1007/s00224-014-9572-6openalex-extracted

On Fixed Cost k-Flow Problems

inferredcites →https://doi.org/10.1007/s10107-006-0057-5openalex-extracted

Power optimization for connectivity problems

inferredcites →https://doi.org/10.1007/s11276-005-1765-0openalex-extracted

Finding Minimum Energy Disjoint Paths in Wireless Ad-Hoc Networks

inferredcites →https://doi.org/10.1007/s11276-005-5275-xopenalex-extracted

Power Efficient Range Assignment for Symmetric Connectivity in Static Ad Hoc Wireless Networks

inferredcites →https://doi.org/10.1016/j.jda.2009.03.002openalex-extracted

On minimum power connectivity problems

inferredcites →https://doi.org/10.1016/j.tcs.2010.03.009openalex-extracted

Approximating minimum power covers of intersecting families and directed edge-connectivity problems

inferredcites →https://doi.org/10.1016/s0304-3975(98)00223-0openalex-extracted

Power consumption in packet radio networks

inferredcites →https://doi.org/10.1093/comjnl/bxp121openalex-extracted

Handbook of Approximation Algorithms and Metaheuristics

inferredcites →https://doi.org/10.1109/49.779917openalex-extracted

Minimum energy mobile wireless networks

inferredcites →https://doi.org/10.1109/infcom.2000.832232openalex-extracted

On the construction of energy-efficient broadcast and multicast trees in wireless networks

inferredcites →https://doi.org/10.1137/080729645openalex-extracted

Approximating Steiner Networks with Node-Weights

inferredcites →https://doi.org/10.1137/1.9781611973082.78openalex-extracted

Survivable Network Design Problems in Wireless Networks

inferredcites →https://doi.org/10.1145/3055399.3055412openalex-extracted

Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph

inferredcites →https://doi.org/10.48550/arxiv.1001.2891openalex-extracted

Detecting High Log-Densities -- an O(n^1/4) Approximation for Densest k-Subgraph

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.