Independent sets in Line of Sight networks (Q2201775): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127965394, #quickstatements; #temporary_batch_1723978926063
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2019.03.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2942569330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4459826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line-of-Sight Percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficiency of polynomial time approximation schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2844618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5747389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for drawing graphs: An annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and analysis of approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line-of-Sight Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple heuristics for unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Embeddings into Hamming Graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gridline graphs: A review in two dimensions and an extension to higher dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming optimization in line of sight networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality considerations in VLSI circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elimination Graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127965394 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:06, 18 August 2024

scientific article
Language Label Description Also known as
English
Independent sets in Line of Sight networks
scientific article

    Statements

    Independent sets in Line of Sight networks (English)
    0 references
    0 references
    0 references
    17 September 2020
    0 references
    line of sight networks
    0 references
    independent sets
    0 references
    approximation algorithms
    0 references
    approximation hardness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references