Document Open Access Logo

Gender-Aware Facility Location in Multi-Gender World

Authors Valentin Polishchuk, Leonid Sedov

PDF

File

Thumbnail PDF
PDF
LIPIcs.FUN.2018.28.pdf
  • Filesize: 0.62 MB
  • 16 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
Keywords
  • visibility
  • Strahler number
  • perfect tree
  • interval graphs
  • gender studies

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

This interdisciplinary (GS and CS) paper starts from considering the problem of locating restrooms or locker rooms in a privacy-preserving way, i.e., so that while following the path to one's room, one cannot peek into another room; the rooms are meant for a multitude of genders, one room per gender. We then proceed to showing that gender inequality (non-uniform treatment of genders by genders) makes the room placement hard. Finally, we delve into specifics of gender definition and consider locating facilities for the genders in a "perfect" way, i.e., so that navigating to the facilities involves only quick binary decisions; on the way, we indicate that there is room for interpretation the facilities under consideration (we outline several possibilities, depending on the application).

Cite As Get BibTex

Valentin Polishchuk and Leonid Sedov. Gender-Aware Facility Location in Multi-Gender World. In 9th International Conference on Fun with Algorithms (FUN 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 100, pp. 28:1-28:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018) https://doi.org/10.4230/LIPIcs.FUN.2018.28

Author Details

Valentin Polishchuk
  • Communications and Transport Systems, ITN, Linköping University, Sweden
Leonid Sedov
  • Communications and Transport Systems, ITN, Linköping University, Sweden

References

  1. Srinivasa Arikati and C. Rangan. An efficient algorithm for finding a two-pair, and its applications. Discrete Applied Mathematics, 31(1):71-74, 1991. Google Scholar
  2. Svante Carlsson, Håkan Jonsson, and Bengt J. Nilsson. Finding the shortest watchman route in a simple polygon. Discrete & Computational Geometry, 22(3):377-402, 1999. URL: http://dx.doi.org/10.1007/PL00009467.
  3. Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein. Introduction to Algorithms. The MIT Press, 3rd edition, 2009. Google Scholar
  4. Sandip Das, M Sen, AB Roy, and Douglas B West. Interval digraphs. J. Graph Theory, 13(2):189-202, 1989. Google Scholar
  5. Donna Dean. Changing ones: 3rd & 4th genders in native America. Women and Military, 18(2):54-54, 2000. Google Scholar
  6. Moshe Dror, Alon Efrat, Anna Lubiw, and Joseph Mitchell. Touring a sequence of polygons. In Lawrence L. Larmore and Michel X. Goemans, editors, SToC'03, pages 473-482. ACM, 2003. Google Scholar
  7. Adrian Dumitrescu and Csaba D. Tóth. Watchman tours for polygons with holes. Comput. Geom., 45(7):326-333, 2012. URL: http://dx.doi.org/10.1016/j.comgeo.2012.02.001.
  8. Stephan Eidenbenz. Inapproximability of finding maximum hidden sets on polygons and terrains. CGTA, 21(3):139-153, 2002. Google Scholar
  9. Javier Esparza, Michael Luttenberger, and Maximilian Schlund. Fpsolve: A generic solver for fixpoint equations over semirings. Intl J Foundations of Computer Science, 26(07):805-825, 2015. Google Scholar
  10. European Commission. URL: http://ec.europa.eu/research/swafs/gendered-innovations/index_en.cfm.
  11. Michael R. Garey and David S. Johnson. Computers and Intractability. Freeman &Co., New York, NY, USA, 1979. Google Scholar
  12. Subir Ghosh. Visibility Algorithms in the Plane. Cambridge University Press, New York, NY, USA, 2007. Google Scholar
  13. J.E. Goodman and J. O'Rourke, editors. Handbook of Discrete and Computational Geometry. Discrete Mathematics and Its Applications. Taylor &Francis, 2nd edition, 2004. Google Scholar
  14. Sharyn Graham. Sulawesi’s fifth gender. Inside Indonesia, 66, 2001. Google Scholar
  15. Martin Grötschel, László Lovász, and Alexander Schrijver. Combinatorial optimization, volume 2. Springer Science &Business Media, 2012. Google Scholar
  16. Dan Gusfield and Robert Irving. The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge, MA, USA, 1989. Google Scholar
  17. Vi Hart. https://www.youtube.com/watch?v=hmKix-75dsg, 2015.
  18. Ryan Hayward, Chính Hoàng, and Frédéric Maffray. Optimizing weakly triangulated graphs. Graphs and Combinatorics, 5(1):339-349, Dec 1989. Google Scholar
  19. Ryan Hayward, Jeremy Spinrad, and R. Sritharan. Weakly chordal graph algorithms via handles. In SODA'00, pages 42-49, Philadelphia, PA, USA, 2000. Society for Industrial and Applied Mathematics. Google Scholar
  20. Ryan B Hayward. Weakly triangulated graphs. J Comb Theory, Series B, 39(3):200-208, 1985. Google Scholar
  21. Aaron Homer. https://www.inquisitr.com/2804761/man-uses-womens-locker-room-at-seattle-pool-says-its-legal-because-of-anti-transgender-discrimination-laws/, 2016.
  22. M Kay Martin and Barbara Voorhies. Female of the Species. Columbia University Press, 1975. Google Scholar
  23. J. Mitchell, G. Rote, and G. Woeginger. Minimum-link paths among obstacles. Alg-ca'92, 8(1):431-459, 1992. Google Scholar
  24. Joseph Mitchell. Approximating watchman routes. In Sanjeev Khanna, editor, Proc. 24th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA'13, New Orleans, Louisiana, USA, pages 844-855. SIAM, 2013. Google Scholar
  25. Joseph S. B. Mitchell, Valentin Polishchuk, and Mikko Sysikaski. Minimum-link paths revisited. Comput. Geom., 47(6):651-667, 2014. URL: http://dx.doi.org/10.1016/j.comgeo.2013.12.005.
  26. Cynthia J Novack. Ballet, gender and cultural power. In Dance, gender and culture, pages 34-48. Springer, 1993. Google Scholar
  27. Joseph O'Rourke. Art Gallery Theorems and Algorithms. The International Series of Monographs on Computer Science. Oxford University Press, New York, NY, 1987. Google Scholar
  28. Eli Packer. Computing multiple watchman routes. In Catherine C. McGeoch, editor, SEA'08, volume 5038 of Lecture Notes in Computer Science, pages 114-128. Springer, 2008. Google Scholar
  29. Erich Prisner. A characterization of interval catch digraphs. Discrete Math, 73(3):285-289, 1989. Google Scholar
  30. Erich Prisner. Algorithms for interval catch digraphs. Discrete Appl Math, 51(1-2):147-157, 1994. Google Scholar
  31. Arvind Raghunathan. Algorithms for weakly triangulated graphs, 1989. Tech Rep, UC Berkeley. URL: http://www2.eecs.berkeley.edu/Pubs/TechRpts/1989/5196.html.
  32. Londa Schiebinger. https://www.youtube.com/watch?v=JaYzdz9X3n4, 2013.
  33. T Shermer. Hiding people in polygons. Computing, 42(2):109-131, 1989. Google Scholar
  34. Jeremy P. Spinrad and R. Sritharan. Algorithms for weakly triangulated graphs. Discrete Applied Mathematics, 59(2):181-191, 1995. URL: http://dx.doi.org/10.1016/0166-218X(93)E0161-Q.
  35. Stanford University. URL: https://genderedinnovations.stanford.edu.
  36. Steven H Strogatz. Love affairs and differential equations. Mathematics Magazine, 61(1):35, 1988. Google Scholar
  37. Subhash Suri. A linear-time algorithm for minimum link paths inside a simple polygon. Computer Vision, Graphics and Image Processing, 35(1):99-110, 1986. Google Scholar
  38. Erica Tempesta. http://www.dailymail.co.uk/femail/article-4118028/Stereotypes-broken-Plus-size-ballerina-online-star-footage-teen-executing-elaborate-turning-sequence-goes-viral.html, 2017.
  39. Randolph Trumbach. From 3 sexes to 4 genders in the making of modern culture. Routledge, 1991. Google Scholar
  40. Peter Walker. http://www.telegraph.co.uk/news/2017/06/04/men-need-lots-energy-lift-ballet-dancers-women-getting-taller/, 2017.
  41. Wikipedia contributors. https://en.wikipedia.org/w/index.php?title=Strahler_number&oldid=815882619, 2017.
  42. Wikipedia contributors. https://en.wikipedia.org/w/index.php?oldid=810002918, 2018.
  43. Wikipedia contributors. https://en.wikipedia.org/w/index.php?title=Third_gender&oldid=819839594, 2018.
  44. Yuming Zou and Paul Black. https://www.nist.gov/dads/HTML/perfectBinaryTree.html. In Vreda Pieterse and Paul E. Black, editors, Dictionary of Algorithms and Data Structures. National Institute of Standards and Technology, 2008.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact