{"id":"https://openalex.org/W2275468787","doi":null,"title":"Approximation algorithms for graph problems","display_name":"Approximation algorithms for graph problems","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2275468787","mag":"2275468787"},"language":"en","primary_location":{"id":"mag:2275468787","doi":null,"is_oa":false,"landing_page_url":"https://etda.libraries.psu.edu/catalog/8897","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},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5036801391","display_name":"Shiva Prasad Kasiviswanathan","orcid":"https://orcid.org/0000-0002-1725-2621","observed_orcids":["https://orcid.org/0000-0002-1725-2621"]},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Shiva Prasad Kasiviswanathan","raw_affiliation_strings":["The Pennsylvania State University"],"raw_orcid":"https://orcid.org/0000-0002-1725-2621","affiliations":[{"raw_affiliation_string":"The Pennsylvania State University","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5036801391"],"corresponding_institution_ids":["https://openalex.org/I130769515"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9726999998092651,"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.9726999998092651,"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.026399999856948853,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.0003000000142492354,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/approximation-algorithms","display_name":"approximation algorithms","score":0.8550000190734863},{"id":"https://openalex.org/keywords/subgraph-counting","display_name":"subgraph counting","score":0.7160000205039978},{"id":"https://openalex.org/keywords/subgraph-isomorphism","display_name":"subgraph isomorphism","score":0.9589999914169312},{"id":"https://openalex.org/keywords/fpras","display_name":"FPRAS","score":0.8500000238418579},{"id":"https://openalex.org/keywords/geometric-intersection-graphs","display_name":"geometric intersection graphs","score":0.6930000185966492},{"id":"https://openalex.org/keywords/disk-graphs","display_name":"disk graphs","score":0.9869999885559082},{"id":"https://openalex.org/keywords/spanners","display_name":"spanners","score":0.781000018119812},{"id":"https://openalex.org/keywords/distance-queries","display_name":"distance queries","score":0.6840000152587891},{"id":"https://openalex.org/keywords/geometric-graphs","display_name":"geometric graphs","score":0.621999979019165},{"id":"https://openalex.org/keywords/planar-graphs","display_name":"planar graphs","score":0.671999990940094},{"id":"https://openalex.org/keywords/outerplanar-graphs","display_name":"outerplanar graphs","score":0.8650000095367432},{"id":"https://openalex.org/keywords/series-parallel-graphs","display_name":"series-parallel graphs","score":0.8970000147819519},{"id":"https://openalex.org/keywords/wireless-ad-hoc-networks","display_name":"wireless ad hoc networks","score":0.8859999775886536}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.708673894405365},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6299909353256226},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5613287091255188},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.46228480339050293},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.44360700249671936},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.4220760762691498},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.41886845231056213},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4176991581916809},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4155643582344055},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4142377972602844},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27614232897758484}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2275468787","doi":null,"is_oa":false,"landing_page_url":"https://etda.libraries.psu.edu/catalog/8897","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}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":99,"referenced_works":["https://openalex.org/W63269804","https://openalex.org/W69299978","https://openalex.org/W108314478","https://openalex.org/W226703363","https://openalex.org/W326304601","https://openalex.org/W331362054","https://openalex.org/W1485732691","https://openalex.org/W1488638744","https://openalex.org/W1494596592","https://openalex.org/W1496357020","https://openalex.org/W1504049780","https://openalex.org/W1505970908","https://openalex.org/W1519501721","https://openalex.org/W1523448599","https://openalex.org/W1527197079","https://openalex.org/W1544839292","https://openalex.org/W1552092932","https://openalex.org/W1575027696","https://openalex.org/W1607251184","https://openalex.org/W1610094221","https://openalex.org/W1666015432","https://openalex.org/W1670923310","https://openalex.org/W1768571955","https://openalex.org/W1816350644","https://openalex.org/W1930019869","https://openalex.org/W1967852832","https://openalex.org/W1971916396","https://openalex.org/W1974672137","https://openalex.org/W1975248037","https://openalex.org/W1981681460","https://openalex.org/W1985758609","https://openalex.org/W1986137624","https://openalex.org/W1986979529","https://openalex.org/W1991965073","https://openalex.org/W1994584977","https://openalex.org/W2002273934","https://openalex.org/W2005234139","https://openalex.org/W2005687471","https://openalex.org/W2006912660","https://openalex.org/W2007746582","https://openalex.org/W2008979299","https://openalex.org/W2021084480","https://openalex.org/W2024710200","https://openalex.org/W2028293948","https://openalex.org/W2028430839","https://openalex.org/W2028738060","https://openalex.org/W2030726651","https://openalex.org/W2031671531","https://openalex.org/W2032789786","https://openalex.org/W2032966476","https://openalex.org/W2033811139","https://openalex.org/W2037366109","https://openalex.org/W2037835214","https://openalex.org/W2045446569","https://openalex.org/W2046946959","https://openalex.org/W2050140567","https://openalex.org/W2054011861","https://openalex.org/W2054621199","https://openalex.org/W2056084417","https://openalex.org/W2056539002","https://openalex.org/W2060123147","https://openalex.org/W2063342497","https://openalex.org/W2065574581","https://openalex.org/W2073251835","https://openalex.org/W2082551413","https://openalex.org/W2092534058","https://openalex.org/W2093073853","https://openalex.org/W2093241092","https://openalex.org/W2093521781","https://openalex.org/W2097333461","https://openalex.org/W2101599991","https://openalex.org/W2105925045","https://openalex.org/W2106285343","https://openalex.org/W2106668810","https://openalex.org/W2121431945","https://openalex.org/W2121808152","https://openalex.org/W2136022810","https://openalex.org/W2142887429","https://openalex.org/W2144668683","https://openalex.org/W2151021662","https://openalex.org/W2151536080","https://openalex.org/W2153386886","https://openalex.org/W2156271404","https://openalex.org/W2157529519","https://openalex.org/W2159525520","https://openalex.org/W2161843738","https://openalex.org/W2164807054","https://openalex.org/W2166965860","https://openalex.org/W2168919539","https://openalex.org/W2295428206","https://openalex.org/W2295578127","https://openalex.org/W2395889972","https://openalex.org/W2478722229","https://openalex.org/W2905110430","https://openalex.org/W2908728486","https://openalex.org/W3020889619","https://openalex.org/W3111890340","https://openalex.org/W3215037115","https://openalex.org/W4244381242"],"related_works":["https://openalex.org/W7100560315","https://openalex.org/W1994987445","https://openalex.org/W1519500192","https://openalex.org/W2405491674","https://openalex.org/W6947745689","https://openalex.org/W2081449822","https://openalex.org/W2590333797","https://openalex.org/W1501150662","https://openalex.org/W7207811849","https://openalex.org/W7096776175"],"abstract_inverted_index":{"This":[0,52,225],"thesis":[1],"studies":[2],"approximation":[3,91,103,142,219],"algorithms":[4,255,383],"for":[5,83,144,221,256,334,340,384,410],"two":[6,286,296],"fundamental":[7],"problems":[8],"arising":[9],"in":[10,18,24,48,148,188,203,207,244,315,389,415],"graph":[11,17,20,47,151,273,277,302,306],"theory:":[12],"counting":[13,39,55,145,185],"copies":[14,43],"of":[15,30,38,42,44,57,71,98,107,118,124,156,184,210,234,242,250,261,268,294,307,310,373],"one":[16,45,280],"another":[19,49],"and":[21,62,121,128,158,215,284,405,413],"estimating":[22],"distances":[23],"geometric":[25,262,269],"graphs.\r\nIn":[26],"the":[27,36,40,54,58,67,96,180,208,211,230,245,247,292,295,316,331,349,354,357,363,371],"first":[28,68,332],"part":[29,249],"this":[31,72,192,251],"thesis,":[32,252],"we":[33,85,135,194,253,360],"look":[34],"at":[35,109],"problem":[37,61,73,155,183],"number":[41],"(template)":[46],"(base)":[50],"graph.":[51,190],"is":[53,63,75,216,227,274,298,303,323],"version":[56],"subgraph":[59],"isomorphism":[60],"#P-complete.":[64],"We":[65,160,177,329,379],"present":[66,195,254,330,381],"general":[69,164],"subcase":[70],"which":[74,84,166],"almost":[76,86,205,222,368],"always":[77,87],"efficiently":[78],"approximable.":[79],"The":[80,200,343],"template":[81],"families":[82],"obtain":[88,137],"an":[89,153,275,289,304],"efficient":[90,382],"algorithm":[92,201,226,233,333,344],"(formally":[93],"captured":[94],"by":[95,236,288],"notion":[97],"a":[99,132,138,149,163,189,196,217,237,266,308,326,374],"fully":[100,139],"polynomial":[101,140],"randomized":[102,141,198,218],"scheme)":[104],"include":[105],"graphs":[106,393],"degree":[108],"most":[110],"two,":[111],"bounded-degree":[112,119],"forests,":[113],"bounded-width":[114],"grid":[115],"graphs,":[116,120,126],"subdivisions":[117],"major":[122],"subclasses":[123],"outerplanar":[125],"series-parallel":[127],"planar":[129],"graphs.":[130,224,264,342,391],"As":[131],"simple":[133,197],"consequence,":[134],"also":[136,161,380],"scheme":[143,220],"all":[146,223,353],"cycles":[147],"random":[150],"(solving":[152],"open":[154],"Frieze":[157],"McDiarmid).":[159],"provide":[162],"technique":[165],"can":[167],"easily":[168],"be":[169],"applied":[170],"to":[171,320,370,398],"proving":[172],"many":[173],"more":[174],"similar":[175],"results.":[176],"then":[178],"investigate":[179],"famous":[181],"#P-complete":[182],"perfect":[186],"matchings":[187],"For":[191,348],"problem,":[193],"algorithm.":[199],"runs":[202],"time":[204],"linear":[206],"size":[209],"input":[212],"adjacency":[213],"matrix":[214],"faster":[228],"than":[229],"previous":[231],"best":[232],"Chien":[235],"factor":[238],"on":[239],"n":[240],"(number":[241],"vertices":[243],"graph).\r\nIn":[246],"second":[248],"constructing":[257,335],"approximate":[258,386],"sparse":[259,336],"representations":[260],"intersection":[263,272,293,305],"Given":[265],"collection":[267],"objects,":[270],"their":[271],"undirected":[276],"that":[278,362],"has":[279,366],"vertex":[281],"per":[282],"object,":[283],"connects":[285],"objects":[287,297],"edge":[290],"whenever":[291],"nonempty.":[299],"A":[300],"disk":[301],"set":[309],"disks":[311],"with":[312],"arbitrary":[313],"radii":[314],"plane":[317],"(the":[318],"generalization":[319],"higher":[321],"dimensions":[322],"known":[324],"as":[325],"ball":[327,341,390],"graph).":[328],"(1":[337],"+":[338],"e)-spanners":[339],"takes":[345],"sub-quadratic":[346],"time.":[347],"special":[350],"case":[351],"where":[352],"balls":[355],"have":[356,394],"same":[358],"radius,":[359],"show":[361],"spanner":[364],"construction":[365,372],"complexity":[367],"equivalent":[369],"Euclidean":[375],"minimum":[376],"spanning":[377],"tree.":[378],"answering":[385],"distance":[387,406],"queries":[388,407],"Disk":[392],"been":[395],"widely":[396],"used":[397,409],"model":[399],"wireless":[400],"ad":[401],"hoc":[402],"networks.":[403,417],"Spanners":[404],"are":[408],"topology":[411],"control":[412],"routing":[414],"these":[416]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}