scientific article; zbMATH DE number 7561427

DOI10.4230/LIPIcs.ISAAC.2018.73MaRDI QIDQ5091070

Dimitris Fotakis, Abhinav Srivastav, Claire Mathieu, Laurent Gourvès

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

local searchfacility locationgeometric set cover

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties)
• Improved results on geometric hitting set problems
• A unified approach to approximating partial covering problems
• Facility location with red-blue demands
• The hardness of approximating spanner problems
• Design networks with bounded pairwise distance
• Weighted geometric set multi-cover via quasi-uniform sampling
• The Online Set Cover Problem
• Budgeted Red-Blue Median and Its Generalizations
• Approximation schemes for covering and packing problems in image processing and VLSI
• Fast approximation algorithms for a nonconvex covering problem
• On ordered weighted averaging aggregation operators in multicriteria decisionmaking
• Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
• Wavelength rerouting in optical networks, or the Venetian Routing problem
• Fault-tolerant facility location
• Analytical approach to parallel repetition
• Approximation of Partial Capacitated Vertex Cover

This page was built for publication: