{"id":"https://openalex.org/W2410078569","doi":"https://doi.org/10.1007/s10878-016-0035-7","title":"Approximation of knapsack problems with conflict and forcing graphs","display_name":"Approximation of knapsack problems with conflict and forcing graphs","publication_year":2016,"publication_date":"2016-06-06","ids":{"openalex":"https://openalex.org/W2410078569","doi":"https://doi.org/10.1007/s10878-016-0035-7","mag":"2410078569"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-016-0035-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-016-0035-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-016-0035-7.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10878-016-0035-7.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069744603","display_name":"Ulrich Pferschy","orcid":"https://orcid.org/0000-0001-8881-1497"},"institutions":[{"id":"https://openalex.org/I15766117","display_name":"University of Graz","ror":"https://ror.org/01faaaf77","country_code":"AT","type":"education","lineage":["https://openalex.org/I15766117"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Ulrich Pferschy","raw_affiliation_strings":["Department of Statistics and Operations Research, University of Graz, Graz, Austria","Department of Statistics and Operations Research, University of Graz, Universitaetsstr.\u00a015, 8010, Graz, Austria"],"raw_orcid":"https://orcid.org/0000-0001-8881-1497","affiliations":[{"raw_affiliation_string":"Department of Statistics and Operations Research, University of Graz, Graz, Austria","institution_ids":["https://openalex.org/I15766117"]},{"raw_affiliation_string":"Department of Statistics and Operations Research, University of Graz, Universitaetsstr.\u00a015, 8010, Graz, Austria","institution_ids":["https://openalex.org/I15766117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061614451","display_name":"Joachim Schauer","orcid":"https://orcid.org/0000-0002-2268-0612"},"institutions":[{"id":"https://openalex.org/I15766117","display_name":"University of Graz","ror":"https://ror.org/01faaaf77","country_code":"AT","type":"education","lineage":["https://openalex.org/I15766117"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Joachim Schauer","raw_affiliation_strings":["Department of Statistics and Operations Research, University of Graz, Graz, Austria","Department of Statistics and Operations Research, University of Graz, Universitaetsstr.\u00a015, 8010, Graz, Austria"],"raw_orcid":"https://orcid.org/0000-0002-2268-0612","affiliations":[{"raw_affiliation_string":"Department of Statistics and Operations Research, University of Graz, Graz, Austria","institution_ids":["https://openalex.org/I15766117"]},{"raw_affiliation_string":"Department of Statistics and Operations Research, University of Graz, Universitaetsstr.\u00a015, 8010, Graz, Austria","institution_ids":["https://openalex.org/I15766117"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5061614451","https://openalex.org/A5069744603"],"corresponding_institution_ids":["https://openalex.org/I15766117"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":{"value":2990,"currency":"USD","value_usd":2990},"fwci":2.2807,"has_fulltext":true,"cited_by_count":45,"citation_normalized_percentile":{"value":0.90037776,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"33","issue":"4","first_page":"1300","last_page":"1323"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9941999912261963,"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.9933000206947327,"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/knapsack-problem","display_name":"Knapsack problem","score":0.9448586106300354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6755303144454956},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6414620876312256},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.6069303750991821},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.6003648042678833},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48584339022636414},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.46580037474632263},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4282238483428955},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3825373947620392},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24176552891731262},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.23653966188430786},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15625756978988647}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9448586106300354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6755303144454956},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6414620876312256},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.6069303750991821},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.6003648042678833},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48584339022636414},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.46580037474632263},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4282238483428955},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3825373947620392},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24176552891731262},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.23653966188430786},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15625756978988647}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-016-0035-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-016-0035-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-016-0035-7.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:33:y:2017:i:4:d:10.1007_s10878-016-0035-7","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-016-0035-7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"}],"best_oa_location":{"id":"doi:10.1007/s10878-016-0035-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-016-0035-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-016-0035-7.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.800000011920929,"display_name":"Reduced inequalities"}],"awards":[{"id":"https://openalex.org/G1082618294","display_name":"Graph Problems with Knapsack Constraints","funder_award_id":"P23829","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320325582","display_name":"Karl-Franzens-Universit\u00e4t Graz","ror":"https://ror.org/01faaaf77"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2410078569.pdf","grobid_xml":"https://content.openalex.org/works/W2410078569.grobid-xml"},"referenced_works_count":43,"referenced_works":["https://openalex.org/W423157844","https://openalex.org/W1481903965","https://openalex.org/W1499662001","https://openalex.org/W1501644705","https://openalex.org/W1569612812","https://openalex.org/W1579049696","https://openalex.org/W1588395561","https://openalex.org/W1630345158","https://openalex.org/W1965381228","https://openalex.org/W1967799084","https://openalex.org/W1973108067","https://openalex.org/W1977673015","https://openalex.org/W1977889556","https://openalex.org/W1982713256","https://openalex.org/W1985733932","https://openalex.org/W1989539462","https://openalex.org/W2000763343","https://openalex.org/W2000840218","https://openalex.org/W2010030994","https://openalex.org/W2013937449","https://openalex.org/W2021180976","https://openalex.org/W2035637517","https://openalex.org/W2048947076","https://openalex.org/W2050524721","https://openalex.org/W2065769612","https://openalex.org/W2075989463","https://openalex.org/W2078220006","https://openalex.org/W2081254453","https://openalex.org/W2089402478","https://openalex.org/W2099914933","https://openalex.org/W2100432797","https://openalex.org/W2116638623","https://openalex.org/W2118348286","https://openalex.org/W2130481157","https://openalex.org/W2140043891","https://openalex.org/W2153855282","https://openalex.org/W2165102171","https://openalex.org/W2170633983","https://openalex.org/W2187700168","https://openalex.org/W2798588639","https://openalex.org/W3108547121","https://openalex.org/W4230526896","https://openalex.org/W4236127247"],"related_works":["https://openalex.org/W2124568589","https://openalex.org/W2157783000","https://openalex.org/W1883847458","https://openalex.org/W1987143101","https://openalex.org/W2963009577","https://openalex.org/W2788975631","https://openalex.org/W4385327816","https://openalex.org/W2903402681","https://openalex.org/W2061237693","https://openalex.org/W3139101777"],"abstract_inverted_index":{"We":[0,176],"study":[1],"the":[2,50,57,67,85,104,116,127,131,143,160,173,185,193,204,214,290,306],"classical":[3],"0\u20131":[4],"knapsack":[5,105,144,215,265,276],"problem":[6,106,134,145,216,266,277],"with":[7,146,217,267,278],"additional":[8],"restrictions":[9],"on":[10,90,107,135,254,313],"pairs":[11],"of":[12,23,49,69,79,84,118,162,181,195,206,232,244,249,256,289],"items.":[13],"A":[14,59],"conflict":[15,70,110,147,220,279,299],"constraint":[16,43],"states":[17],"that":[18,45,115,154,284],"from":[19,166,184,298],"a":[20,33,41,76,99,168,179,211,241,274,293],"certain":[21,207],"pair":[22],"items":[24,52],"at":[25,46],"most":[26],"one":[27,48],"item":[28],"can":[29,139,152,188,270],"be":[30,54,140,189,271],"contained":[31],"in":[32,56,126],"feasible":[34],"solution.":[35],"Reversing":[36],"this":[37],"condition,":[38],"we":[39,97,113,151],"obtain":[40],"forcing":[42,268,302,307],"stating":[44],"least":[47],"two":[51],"must":[53],"included":[55],"knapsack.":[58],"natural":[60],"way":[61],"for":[62,103,129,159,198,213],"representing":[63],"these":[64],"constraints":[65],"is":[66,222,237,310],"use":[68],"(resp.":[71],"forcing)":[72],"graphs.":[73,111,148,280,303,315],"By":[74],"modifying":[75],"recent":[77],"result":[78,158,243],"Lokstanov":[80],"et":[81,246],"al.":[82,247],"(Proceedings":[83,248],"25th":[86],"annual":[87,251],"ACM-SIAM":[88],"symposium":[89,253],"discrete":[91],"algorithms,":[92],"SODA,":[93],"pp":[94,261],"570\u2013581,":[95],"2014)":[96],"derive":[98],"fairly":[100],"complicated":[101],"FPTAS":[102,197,287],"weakly":[108],"chordal":[109],"Next,":[112],"show":[114,153,192],"techniques":[117],"modular":[119],"decompositions":[120],"and":[121,292],"clique":[122],"separators,":[123],"widely":[124],"used":[125,190],"literature":[128,186],"solving":[130],"independent":[132],"set":[133],"special":[136],"graph":[137,200,221,308],"classes,":[138],"applied":[141],"to":[142,172,191,301],"In":[149,304],"particular,":[150],"every":[155],"positive":[156],"approximation":[157],"atoms":[161],"prime":[163],"graphs":[164,227,231,269,300],"arising":[165],"such":[167],"decomposition":[169],"carries":[170],"over":[171,297],"original":[174],"graph.":[175],"point":[177],"out":[178],"number":[180],"structural":[182],"results":[183,288],"which":[187],"existence":[194],"an":[196],"several":[199],"classes":[201],"characterized":[202],"by":[203,239],"exclusion":[205],"induced":[208],"subgraphs.":[209],"Finally,":[210],"PTAS":[212,236],"H-minor":[218],"free":[219],"derived.":[223],"This":[224],"includes":[225],"planar":[226,314],"and,":[228],"more":[229],"general,":[230],"bounded":[233],"genus.":[234],"The":[235,264],"obtained":[238],"expanding":[240],"general":[242],"Demaine":[245],"46th":[250],"IEEE":[252],"foundations":[255],"computer":[257],"science,":[258],"FOCS":[259],"2005,":[260],"637\u2013646,":[262],"2005).":[263],"transformed":[272],"into":[273],"minimization":[275],"It":[281],"follows":[282],"immediately":[283],"all":[285],"our":[286],"current":[291],"previous":[294],"paper":[295],"carry":[296],"contrast,":[305],"variant":[309],"already":[311],"inapproximable":[312]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}