π
π
The Cartographer
On the Approximability of Independent Set Problem on Power Law Graphs
March 10, 2015 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Mathias Hauptmann, Marek Karpinski
arXiv ID
1503.02880
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.DM,
math.CO,
math.OC
Citations
1
Venue
arXiv.org
Last Checked
4 months ago
Abstract
We give the first nonconstant lower bounds for the approximability of the Independent Set Problem on the Power Law Graphs. These bounds are of the form $n^Ξ΅$ in the case when the power law exponent satisfies $Ξ²<1$. In the case when $Ξ²=1$, the lower bound is of the form $\log (n)^Ξ΅$. The embedding technique used in the proof could also be of independent interest.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted