Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
On the advantage over a random assignment
KTH, Tidigare Institutioner, Numerisk analys och datalogi, NADA.ORCID-id: 0000-0002-5379-345X
2004 (engelsk)Inngår i: Random structures & algorithms (Print), ISSN 1042-9832, E-ISSN 1098-2418, Vol. 25, nr 2, 117-149 s.Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful measure for optimization problems where the random assignment algorithm is known to give essentially the best possible polynomial time approximation. In this paper, we focus on this measure for the optimization problems Max-Lin-2 in which we need to maximize the number of satisfied linear equations in a system of linear equations modulo 2, and Max-k-Lin-2, a special case of the above problem in which each equation has at most k variables. The main techniques we use, in our approximation algorithms and inapproximability results for this measure, are from Fourier analysis and derandomization.

sted, utgiver, år, opplag, sider
2004. Vol. 25, nr 2, 117-149 s.
Emneord [en]
linear system of equations, inapproximability, PCP, approximation algorithms, satisfiability
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-23654DOI: 10.1002/rsa.20031ISI: 000223363800001Scopus ID: 2-s2.0-11144258880OAI: oai:DiVA.org:kth-23654DiVA: diva2:342353
Merknad
QC 20100525 QC 20110923Tilgjengelig fra: 2010-08-10 Laget: 2010-08-10 Sist oppdatert: 2018-01-12bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Håstad, Johan

Søk i DiVA

Av forfatter/redaktør
Håstad, Johan
Av organisasjonen
I samme tidsskrift
Random structures & algorithms (Print)

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 49 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf