Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:3301010
Jump to:navigation, search

DOI10.4230/LIPICS.FUN.2018.22zbMath1489.68193MaRDI QIDQ3301010

Christine Markarian, Heiko Hamann, Friedhelm Meyer auf der Heide, Mostafa Wahby

Publication date: 11 August 2020


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

zbMATH Keywords

competitive analysisgeometric graphonline algorithmconnected dominating setrecharging stationsrobot warehouse


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Randomized algorithms (68W20) Artificial intelligence for robotics (68T40) Online algorithms; streaming algorithms (68W27)





Cites Work

  • Unnamed Item
  • Unnamed Item
  • Towards the price of leasing online
  • Approximation algorithms for connected dominating sets
  • The online set cover problem
  • On the hardness of approximating minimization problems
  • Online Node-Weighted Steiner Tree and Related Problems




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3301010&oldid=16520109"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 4 February 2024, at 12:02.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki