Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Marked Items 
Alerts
Order History
Saved Items
All
Favorites
    
Journal Article Printable view
Clique is hard to approximate within<i>n</i><sup>1−ε</sup>

Clique is hard to approximate withinn1−ε

JournalActa Mathematica
PublisherSpringer Netherlands
ISSN0001-5962 (Print) 1871-2509 (Online)
IssueVolume 182, Number 1 / March, 1999
DOI10.1007/BF02392825
Pages105-142
Subject CollectionMathematics and Statistics
SpringerLink DateThursday, May 11, 2006
Add to marked items

Clique is hard to approximate withinn 1−ε

Johan Håstad1 Contact Information

(1)  Department of Mathematics, Royal Institute of Technology, SE-10044 Stockholm, Sweden

Received: 20 August 1997  

Without Abstract

Contact Information Johan Håstad
Email: johanh@nada.kth.se
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.
more options
Find


Export this article
Export this article as RIS | Text
 
Referenced by
47 newer articles

  1. Scheidegger, Carlos (2007) . IEEE Transactions on Visualization and Computer Graphics 13(6)
    [CrossRef]
  2. Pal, Sourav (2007) . IEEE Transactions on Computers 56(10)
    [CrossRef]
  3. Yıldırım, E. Alper (2009) A simpler characterization of a spectral lower bound on the clique number. Mathematical Methods of Operations Research
    [CrossRef]
  4. Bhattacharyya, Malay (2009) Solving maximum fuzzy clique problem with neural networks and its applications. Memetic Computing
    [CrossRef]
  5. WANG, Zhen (2009) . Journal of Computer Applications 28(10)
    [CrossRef]
  6. Balasundaram, Balabhaskar (2009) Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes. Optimization Letters
    [CrossRef]
  7. Samorodnitsky, Alex (2009) Gowers Uniformity, Influence of Variables, and PCPs. SIAM Journal on Computing 39(1)
    [CrossRef]
  8. Halperin, Eran (2002) Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs. SIAM Journal on Computing 31(5)
    [CrossRef]
  9. Markov, Igor L. (2009) Constant-Degree Graph Expansions that Preserve Treewidth. Algorithmica
    [CrossRef]
  10. Kennedy, Justin (2008) Genotype Error Detection Using Hidden Markov Models of Haplotype Diversity. Journal of Computational Biology 15(9)
    [CrossRef]
First | Next | Last
Frequently asked questions | General information on journals and books | Send us your feedback | Impressum | Contact
© Springer. Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
Remote Address: 38.107.191.96 • Server: mpweb15
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)