SPAA 2020

BA: A local constant approximation factor algorithm for minimum dominating set of certain planar gra

Sep 19, 2020

|

23 views

ACM SPAA 2020

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

ICAPS 2014: Peter Stone on "TEXPLORE: Real-Time Sample-Efficient Reinforcement Learning for Robots"

ICAPS | Aug 6, 2014

ICAPS 2014: Ron Alford on "On the Feasibility of Planning Graph Style Heuristics for HTN Planning"

ICAPS | Aug 6, 2014

ICAPS 2014: Mike Barley on "Overcoming the Utility Problem in Heuristic Generation: ..."

ICAPS | Aug 7, 2014

ICAPS 2014: Stefan Edelkamp on "Symbolic and Explicit Search Hybrid through Perfect Hash Functions"

ICAPS | Aug 7, 2014

ICAPS 2012: Invited Talk by Anthony Cohn

ICAPS | Aug 15, 2014