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

Approximation of dense-\(\frac n2\)-subgraph and table compression problems

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

zbMath1117.05102MaRDI QIDQ882965

Ji-ye Han, Dong-lei Du, Da-Chuan Xu

Publication date: 29 May 2007

Published in: Science in China. Series A (Search for Journal in Brave)


zbMATH Keywords

greedy algorithmrelaxationapproximation algorithmsroundingapproximation ratio


Mathematics Subject Classification ID

Semidefinite programming (90C22) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)


Related Items (1)

Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix







This page was built for publication: Approximation of dense-\(\frac n2\)-subgraph and table compression problems

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