Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Daniel P. Kennedy
Tao Yu
Barbara Aquilani
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Harindu Korala
Chen Ma
Miguel Angel Ferrer-Ballester
Home
/
Paper
/
LP and SDP inapproximability of combinatorial problems.
Paper Info
Open Visualization
Title
LP and SDP inapproximability of combinatorial problems.
Year
Venue
Field
2014
CoRR
Combinatorics,Mathematics
DocType
Volume
Citations
Journal
abs/1410.8816
2
PageRank
References
Authors
0.38
0
3
Authors (3 rows)
Cited by (2 rows)
References (0 rows)
Name
Order
Citations
PageRank
Gábor Braun
1
4
1.09
Sebastian Pokutta
2
267
32.02
Daniel Zink
3
7
1.22
1