scientific article; zbMATH DE number 1303579
From MaRDI portal
Publication:4250205
zbMath0938.68928MaRDI QIDQ4250205
No author found.
Publication date: 21 June 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
Improved algorithms for resource allocation under varying capacity ⋮ A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem ⋮ Approximating points by a piecewise linear function ⋮ On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem ⋮ An approximation algorithm for dissecting a rectangle into rectangles with specified areas ⋮ Temporal interval cliques and independent sets ⋮ Aspects of a multivariate complexity analysis for rectangle tiling ⋮ Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane ⋮ New approximation algorithm for RTILE problem. ⋮ Load-balancing spatially located computations using rectangular partitions ⋮ Computationally-feasible truthful auctions for convex bundles ⋮ Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking ⋮ Matching colored points with rectangles ⋮ Minimum vertex cover in rectangle graphs ⋮ A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks ⋮ Coloring and Maximum Independent Set of Rectangles ⋮ A note on maximum independent sets in rectangle intersection graphs
Uses Software
This page was built for publication:
