Gender-aware facility location in multi-gender world
From MaRDI portal
Publication:3301019
DOI10.4230/LIPICS.FUN.2018.28zbMATH Open1489.68372MaRDI QIDQ3301019FDOQ3301019
Valentin Polishchuk, Leonid Sedov
Publication date: 11 August 2020
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A characterization of interval catch digraphs
- Algorithms for interval catch digraphs
- Interval digraphs: An analogue of interval graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weakly triangulated graphs
- A linear time algorithm for minimum link paths inside a simple polygon
- Touring a sequence of polygons
- Watchman tours for polygons with holes
- Visibility Algorithms in the Plane
- Algorithms for weakly triangulated graphs
- Minimum-link paths revisited
- Optimizing weakly triangulated graphs
- Title not available (Why is that?)
- An efficient algorithm for finding a two-pair, and its applications
- Finding the shortest watchman route in a simple polygon
- Minimum-link paths among obstacles in the plane
- Hiding people in polygons
- Approximating Watchman Routes
- Inapproximability of finding maximum hidden sets on polygons and terrains
- FPSOLVE: A Generic Solver for Fixpoint Equations Over Semirings
Uses Software
This page was built for publication: Gender-aware facility location in multi-gender world
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3301019)