Pages that link to "Item:Q3302475"

From MaRDI portal

← Typical performance of approximation algorithms for NP-hard problems (Q3302475)

Jump to:navigation, search

What links here

⧼whatlinkshere-whatlinkshere-target⧽

Page:

⧼whatlinkshere-whatlinkshere-ns⧽

Namespace:

Invert selection

⧼whatlinkshere-whatlinkshere-filter⧽

Hide transclusions

Hide links

Hide redirects

The following pages link to Typical performance of approximation algorithms for NP-hard problems (Q3302475):

Displaying 2 items.

Two faces of greedy leaf removal procedure on graphs (Q5132111) (← links)
Constructing concrete hard instances of the maximum independent set problem (Q5149679) (← links)

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