BA: A local constant approximation factor algorithm for minimum dominating set of certain planar gra
Sign in
SPAA 2020
Event Home
BA: A local constant approximation factor algorithm for minimum dominating set of certain planar gra
Sep 19, 2020

23 views
ACM SPAA 2020
Follow
Graphs
1420 videos · undefined sub area
Details
Brief Announcement: A local constant approximation factor algorithm for minimum dominating set of certain planar graphs Sharareh Alipour and Amir Jafari Virtual Session 6 SPAA 2020
Category: SPAA 2020
Comments
loading...
Reactions
(0)
 Note
📝 No reactions yet
Be the first one to share your thoughts!
Reactions
(0)
Note
loading...
Recommended
19:59
ICAPS 2014: Peter Stone on "TEXPLORE: RealTime SampleEfficient Reinforcement Learning for Robots"
ICAPS
 Aug 6, 2014
18:02
ICAPS 2014: Ron Alford on "On the Feasibility of Planning Graph Style Heuristics for HTN Planning"
ICAPS
 Aug 6, 2014
22:17
ICAPS 2014: Mike Barley on "Overcoming the Utility Problem in Heuristic Generation: ..."
ICAPS
 Aug 7, 2014
18:33
ICAPS 2014: Stefan Edelkamp on "Symbolic and Explicit Search Hybrid through Perfect Hash Functions"
ICAPS
 Aug 7, 2014
50:27
ICAPS 2012: Invited Talk by Anthony Cohn
ICAPS
 Aug 15, 2014