Pages that link to "Item:Q619902"
From MaRDI portal
The following pages link to Hardness results for approximating the bandwidth (Q619902):
Displaying 17 items.
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- Bandwidth of convex bipartite graphs and related graphs (Q436544) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- Bandwidth of graphs resulting from the edge clique covering problem (Q668017) (← links)
- Exact and approximate bandwidth (Q708223) (← links)
- Approximating the bandwidth via volume respecting embeddings (Q1577009) (← links)
- Bandwidth contrained NP-complete problems (Q1822500) (← links)
- Grid drawings of graphs with constant edge-vertex resolution (Q2230412) (← links)
- Approximating the bandwidth of caterpillars (Q2391175) (← links)
- Approximating bandwidth by mixing layouts of interval graphs (Q2741348) (← links)
- Approximating the bandwidth via volume respecting embeddings (extended abstract) (Q4542524) (← links)
- (Q4543985) (← links)
- Retracting Graphs to Cycles (Q5091228) (← links)
- Critical elements in combinatorially closed families of graph classes (Q5269161) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479359) (← links)
- Parameterized algorithms for minimum sum vertex cover (Q6547957) (← links)
- Ordering transactions with bounded unfairness: definitions, complexity and constructions (Q6637324) (← links)