Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Daniel P. Kennedy
Barbara Aquilani
Jing Li
Ben Robins
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Chen Ma
ChangHwan Kim
Home
/
Paper
/
Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut.
Paper Info
Open Visualization
Title
Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut.
Year
DOI
Venue
2020
10.4230/LIPIcs.CCC.2020.9
CCC
DocType
Citations
PageRank
Conference
0
0.34
References
Authors
0
2
Authors (2 rows)
Cited by (0 rows)
References (0 rows)
Name
Order
Citations
PageRank
Amey Bhangale
1
10
6.71
Subhash Khot
2
2064
112.51
1