Pages that link to "Item:Q4210142"

From MaRDI portal

← On Syntactic versus Computational Views of Approximability (Q4210142)

Jump to:navigation, search

The following pages link to On Syntactic versus Computational Views of Approximability (Q4210142):

Displaying 2 items.

Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
On approximation properties of the Independent set problem for degree 3 graphs (Q5057456) (← links)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:WhatLinksHere/Item:Q4210142"