{"id":"https://openalex.org/W2082372600","doi":"https://doi.org/10.1137/s0097539795285102","title":"Weighted NP Optimization Problems: Logical Definability and Approximation Properties","display_name":"Weighted NP Optimization Problems: Logical Definability and Approximation Properties","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2082372600","doi":"https://doi.org/10.1137/s0097539795285102","mag":"2082372600"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539795285102","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795285102","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046763801","display_name":"Marius Zimand","orcid":"https://orcid.org/0000-0002-5938-6599"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Marius Zimand","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5046763801"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.21304915,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"28","issue":"1","first_page":"36","last_page":"56"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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.9998000264167786,"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.9970999956130981,"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/T10142","display_name":"Formal Methods in Verification","score":0.9962000250816345,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7312595248222351},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6197463870048523},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.6090453267097473},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.5824409127235413},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4883832335472107},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.46846291422843933},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4529343247413635},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41837477684020996},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.395329087972641}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7312595248222351},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6197463870048523},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.6090453267097473},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.5824409127235413},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4883832335472107},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.46846291422843933},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4529343247413635},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41837477684020996},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.395329087972641},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0097539795285102","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795285102","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.41.8547","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.8547","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://136.160.177.125/pub/approx.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.54.7487","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.7487","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hypatia.dcs.qmw.ac.uk/data/edu/cs.rochester.edu/theory/95.tr516rev.Weighted_NP_optimization_problems.ps.gz","raw_type":"text"},{"id":"pmh:oai:urresearch.rochester.edu:486","is_oa":false,"landing_page_url":"http://hdl.handle.net/1802/635","pdf_url":null,"source":{"id":"https://openalex.org/S4306400518","display_name":"UR Research (University of Rochester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5388228","host_organization_name":"University of Rochester","host_organization_lineage":["https://openalex.org/I5388228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Technical Report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1976960787","https://openalex.org/W2004663163","https://openalex.org/W2007053458","https://openalex.org/W2038225707","https://openalex.org/W2063981365","https://openalex.org/W2064600658","https://openalex.org/W2082160108","https://openalex.org/W2088188524","https://openalex.org/W2157054705","https://openalex.org/W2888871578","https://openalex.org/W4248492530","https://openalex.org/W4256317935"],"related_works":["https://openalex.org/W4294364856","https://openalex.org/W2315570462","https://openalex.org/W2164522043","https://openalex.org/W2299552569","https://openalex.org/W4361796174","https://openalex.org/W2529017546","https://openalex.org/W4383216082","https://openalex.org/W2102369687","https://openalex.org/W4298018575","https://openalex.org/W2700088093"],"abstract_inverted_index":{"Extending":[0],"a":[1,47,62,73],"well-known":[2],"property":[3],"of":[4,12,24,39,83,88],"NP":[5,43,55],"optimization":[6,44,56,89],"problems":[7,45,90],"in":[8,21,64,99],"which":[9,65],"the":[10,13,22,25,37,40,66,80,100],"value":[11],"optimum":[14],"is":[15,28,51],"guaranteed":[16],"to":[17,34,94],"be":[18,59,70],"polynomially":[19],"bounded":[20],"length":[23],"input,":[26,41],"it":[27],"observed":[29],"that,":[30],"by":[31,72],"attaching":[32],"weights":[33,108],"tuples":[35],"over":[36],"domain":[38],"all":[42,84],"admit":[46],"logical":[48],"characterization.":[49],"It":[50],"shown":[52],"that":[53,91],"any":[54],"problem":[57,63],"can":[58,69],"stated":[60],"as":[61],"constraint":[67],"conditions":[68],"expressed":[71],"$\\Pi_2$":[74],"first-order":[75],"formula.":[76],"The":[77],"paper":[78],"analyzes":[79],"weighted":[81],"analogue":[82],"syntactically":[85],"defined":[86],"classes":[87],"are":[92,109],"known":[93],"have":[95],"good":[96],"approximation":[97],"properties":[98],"nonweighted":[101],"case.":[102],"Dramatic":[103],"changes":[104],"occur":[105],"when":[106],"negative":[107],"allowed.":[110]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}