{"id":"https://openalex.org/W1551497449","doi":null,"title":"Some new randomized approximation algorithms","display_name":"Some new randomized approximation algorithms","alternate_titles":[],"publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1551497449","mag":"1551497449"},"language":"en","primary_location":{"id":"pmh:oai:DiVA.org:kth-2971","doi":null,"is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-2971","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I86987016","host_organization_name":"KTH Royal Institute of Technology","host_organization_lineage":["https://openalex.org/I86987016"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/doctoralThesis"},"parent_works":[],"lineage":["https://openalex.org/W1551497449"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-2971","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Gunnar Andersson","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Gunnar Andersson","raw_affiliation_strings":["Department of Numerical Analysis and Computer Science, Royal Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Numerical Analysis and Computer Science, Royal Institute of Technology","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.000699999975040555,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/randomized-approximation-algorithms","display_name":"randomized approximation algorithms","score":0.9110000133514404},{"id":"https://openalex.org/keywords/performance-guarantees","display_name":"performance guarantees","score":0.6539999842643738},{"id":"https://openalex.org/keywords/polynomial-time-approximation","display_name":"polynomial-time approximation","score":0.796999990940094},{"id":"https://openalex.org/keywords/worst-case-analysis","display_name":"worst-case analysis","score":0.5460000038146973},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.7440000176429749}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7123291492462158},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6131128072738647},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5548436045646667},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5401128530502319},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5335244536399841},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.5236960649490356},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5006453990936279},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46002641320228577},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.436997652053833},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42481300234794617},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26887935400009155},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:DiVA.org:kth-2971","doi":null,"is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-2971","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I86987016","host_organization_name":"KTH Royal Institute of Technology","host_organization_lineage":["https://openalex.org/I86987016"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/doctoralThesis"},{"id":"mag:1551497449","doi":null,"is_oa":false,"landing_page_url":"http://kth.diva-portal.org/smash/get/diva2:8713/FULLTEXT01.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.12.3423","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.3423","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lib.kth.se/Fulltext/ANDERSSON000526.PDF","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:DiVA.org:kth-2971","doi":null,"is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-2971","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I86987016","host_organization_name":"KTH Royal Institute of Technology","host_organization_lineage":["https://openalex.org/I86987016"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/doctoralThesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1551497449.pdf","grobid_xml":"https://content.openalex.org/works/W1551497449.grobid-xml"},"referenced_works_count":89,"referenced_works":["https://openalex.org/W56765902","https://openalex.org/W118210480","https://openalex.org/W189633613","https://openalex.org/W239232176","https://openalex.org/W1479930546","https://openalex.org/W1483204526","https://openalex.org/W1505937274","https://openalex.org/W1525063915","https://openalex.org/W1527468245","https://openalex.org/W1564025554","https://openalex.org/W1573039931","https://openalex.org/W1588677974","https://openalex.org/W1601503375","https://openalex.org/W1656795039","https://openalex.org/W1963753244","https://openalex.org/W1965762037","https://openalex.org/W1967935161","https://openalex.org/W1970630090","https://openalex.org/W1975442866","https://openalex.org/W1983593474","https://openalex.org/W1985123706","https://openalex.org/W1990313671","https://openalex.org/W1999678910","https://openalex.org/W2001564241","https://openalex.org/W2010990954","https://openalex.org/W2011039300","https://openalex.org/W2019578639","https://openalex.org/W2026634792","https://openalex.org/W2026820987","https://openalex.org/W2027020884","https://openalex.org/W2027048490","https://openalex.org/W2029163643","https://openalex.org/W2036265926","https://openalex.org/W2038225707","https://openalex.org/W2040924621","https://openalex.org/W2041756370","https://openalex.org/W2041979432","https://openalex.org/W2043506441","https://openalex.org/W2053308793","https://openalex.org/W2058937865","https://openalex.org/W2059608229","https://openalex.org/W2064600658","https://openalex.org/W2065641139","https://openalex.org/W2068871408","https://openalex.org/W2069816168","https://openalex.org/W2072858942","https://openalex.org/W2079751294","https://openalex.org/W2080905757","https://openalex.org/W2081254453","https://openalex.org/W2082647621","https://openalex.org/W2086653003","https://openalex.org/W2086917808","https://openalex.org/W2088188524","https://openalex.org/W2093546055","https://openalex.org/W2094135928","https://openalex.org/W2103012681","https://openalex.org/W2109039359","https://openalex.org/W2109694798","https://openalex.org/W2110367141","https://openalex.org/W2111385661","https://openalex.org/W2123068254","https://openalex.org/W2125347105","https://openalex.org/W2127470768","https://openalex.org/W2132605415","https://openalex.org/W2137373403","https://openalex.org/W2141815340","https://openalex.org/W2143391442","https://openalex.org/W2148352980","https://openalex.org/W2148360835","https://openalex.org/W2166566648","https://openalex.org/W2171554063","https://openalex.org/W2202947145","https://openalex.org/W2293988196","https://openalex.org/W2295428206","https://openalex.org/W2319489891","https://openalex.org/W2396166977","https://openalex.org/W2486715098","https://openalex.org/W2504067247","https://openalex.org/W2611147814","https://openalex.org/W2797963462","https://openalex.org/W2798909945","https://openalex.org/W2912522929","https://openalex.org/W2917997019","https://openalex.org/W3127113455","https://openalex.org/W3161056635","https://openalex.org/W4233413206","https://openalex.org/W4233756358","https://openalex.org/W4301216918","https://openalex.org/W6990023262"],"related_works":["https://openalex.org/W1990313671","https://openalex.org/W7097066899","https://openalex.org/W2407532194","https://openalex.org/W7096168041","https://openalex.org/W632831340","https://openalex.org/W2072292773","https://openalex.org/W4239031269","https://openalex.org/W7098060570","https://openalex.org/W7100180951","https://openalex.org/W7095629850"],"abstract_inverted_index":{"The":[0],"topic":[1],"of":[2,11,50,70,72,103,106,110,118,149,204,267,286],"this":[3,172,202,298],"thesis":[4],"is":[5,67,113,143,153,275,300,305],"approximation":[6,28,36,74,87,177,257],"algorithms":[7,16,29,88,217],"for":[8,23,89,128,135,179,225,259,271],"optimization":[9],"versions":[10],"NP-complete":[12],"decision":[13],"problems.No":[14],"exact":[15],"with":[17,30,211],"sub-exponential":[18],"running":[19,32],"times":[20,33],"are":[21,34,95,127],"known":[22,176],"these":[24],"problems,":[25],"and":[26,138,192,196,206,239,290],"therefore":[27],"polynomial":[31,255],"studied.An":[35],"algorithm":[37,178],"does":[38],"not":[39],"necessarily":[40],"nd":[41],"the":[42,54,56,62,68,119,141,174,199,260,273,284],"optimal":[43],"solution,":[44],"but":[45],"it":[46,76,304],"leaves":[47],"a":[48,104,160,165,221,254,301,309],"guarantee":[49,66,315],"how":[51],"far":[52],"from":[53],"optimum":[55],"output":[57],"solution":[58,222],"can":[59,156],"be":[60,78,157],"in":[61,194,297],"worst":[63],"case.This":[64],"performance":[65,314],"measure":[69],"quality":[71],"an":[73],"algorithm;":[75],"should":[77],"as":[79,83,116,121],"close":[80],"to":[81,114,215,243,251,307],"1":[82],"possible.We":[84],"present":[85],"new":[86],"several":[90,226],"dierent":[91,227],"maximization":[92],"problems.All":[93],"problems":[94,126,152,248,270],"essentially":[96],"constraint":[97,181,268],"satisfaction":[98,182,269],"problems:":[99,228],"An":[100],"instance":[101],"consists":[102],"set":[105],"constraints":[107,120],"on":[108,124,185,283],"groups":[109],"variables.The":[111],"objective":[112],"satisfy":[115],"many":[117,180],"possible.Most":[122],"results":[123,134],"such":[125,151,247],"binary":[129,136],"variables;":[130],"we":[131],"give":[132],"some":[133,139,312],"variables":[137],"where":[140],"domain":[142,274],"Z":[144,276],"p":[145,266,277],".A":[146],"common":[147],"feature":[148],"all":[150],"that":[154,303],"they":[155,197],"approximated":[158],"within":[159,311],"constant":[161],"factor":[162],"by":[163,190],"picking":[164,220],"variable":[166],"assignment":[167],"uniformly":[168],"at":[169,223],"random.Until":[170],"recently,":[171],"was":[173],"best":[175],"problems.Algorithms":[183],"based":[184],"semidenite":[186,208],"programming":[187,209],"were":[188],"introduced":[189],"Goemans":[191],"Williamson":[193],"1994,":[195],"revolutionized":[198],"eld.We":[200],"continue":[201],"line":[203],"research":[205],"use":[207],"combined":[210],"randomized":[212],"rounding":[213],"schemes":[214],"obtain":[216],"better":[218],"than":[219],"random":[224],"Max":[229,232,235,240,262,287,291],"Set":[230],"Splitting,":[231],"3-Horn":[233],"Sat,":[234],"E2-Lin":[236,292],"mod":[237,265,293],"p,":[238],"p-Section.When":[241],"restricted":[242],"dense":[244],"instances,":[245],"most":[246],"become":[249],"easier":[250],"approximate.We":[252],"devise":[253],"time":[256],"scheme":[258],"family":[261],"Ek-Function":[263],"Sat":[264,289],"which":[272],".We":[278],"also":[279],"prove":[280],"lower":[281,295],"bounds":[282],"approximability":[285],"k-Horn":[288],"p.A":[294],"bound":[296],"context":[299],"proof":[302],"impossible":[306],"approximate":[308],"problem":[310],"given":[313],"unless":[316],"P":[317],"=":[318],"NP.":[319]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1551497449","counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
