scientific article; zbMATH DE number 1261808
From MaRDI portal
Publication:4231911
zbMath0938.68916MaRDI QIDQ4231911
No author found.
Publication date: 26 April 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
Flow metrics ⋮ An experimental evaluation of local search heuristics for graph partitioning ⋮ On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem ⋮ Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems ⋮ Low-light trees, and tight lower bounds for Euclidean spanners ⋮ Designing PTASs for MIN-SUM scheduling problems ⋮ The approximability of non-Boolean satisfiability problems and restricted integer programming ⋮ On the interval completion of chordal graphs ⋮ A tight bound on approximating arbitrary metrics by tree metrics ⋮ Bounds on mincut for Cayley graphs over Abelian groups ⋮ Combinatorial algorithms for feedback problems in directed graphs ⋮ Experiments on the minimum linear arrangement problem ⋮ Approximating small balanced vertex separators in almost linear time ⋮ Selected papers in honor of Manuel Blum on the occasion of his 60th birthday. Selected papers from the international conference in Theoretical Computer Science, Hong Kong, April 20-24, 1998
This page was built for publication:
