{"id":"https://openalex.org/W2065554317","doi":"https://doi.org/10.1080/10556780310001634082","title":"Approximating the 2-catalog segmentation problem using semidefinite programming relaxations","display_name":"Approximating the 2-catalog segmentation problem using semidefinite programming relaxations","publication_year":2003,"publication_date":"2003-12-01","ids":{"openalex":"https://openalex.org/W2065554317","doi":"https://doi.org/10.1080/10556780310001634082","mag":"2065554317"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780310001634082","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5100341936","display_name":"Dachuan Xu","orcid":"https://orcid.org/0000-0002-7846-0969"},"institutions":[{"id":"https://openalex.org/I4210120485","display_name":"Academy of Mathematics and Systems Science","ror":"https://ror.org/02jkmyk67","country_code":"CN","type":"facility","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210120485"]},{"id":"https://openalex.org/I19820366","display_name":"Chinese Academy of Sciences","ror":"https://ror.org/034t30j35","country_code":"CN","type":"government","lineage":["https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Dachuan Xu*","raw_affiliation_strings":["Institute of Applied Mathematics, Academy of Mathematics and Systems Sciences , Chinese Academy of Sciences , Beijing, 100080, P.R. China"],"affiliations":[{"raw_affiliation_string":"Institute of Applied Mathematics, Academy of Mathematics and Systems Sciences , Chinese Academy of Sciences , Beijing, 100080, P.R. China","institution_ids":["https://openalex.org/I4210120485","https://openalex.org/I19820366"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041526408","display_name":"Yinyu Ye","orcid":"https://orcid.org/0009-0001-3239-2622"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yinyu Ye","raw_affiliation_strings":["Department of Management Science and Engineering , Stanford University , Standford, CA, 94305-4026, USA"],"affiliations":[{"raw_affiliation_string":"Department of Management Science and Engineering , Stanford University , Standford, CA, 94305-4026, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100462851","display_name":"Jiawei Zhang","orcid":"https://orcid.org/0000-0003-1377-7938"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jiawei Zhang\u2021","raw_affiliation_strings":["Department of Management Science & Engineering, Stanford University, Stanford, CA 94305, USA"],"affiliations":[{"raw_affiliation_string":"Department of Management Science & Engineering, Stanford University, Stanford, CA 94305, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.696,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":16,"citation_normalized_percentile":{"value":0.834691,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":83,"max":84},"biblio":{"volume":"18","issue":"6","first_page":"705","last_page":"719"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9996,"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.9996,"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.9984,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9954,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite Programming","score":0.49857116},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.43494922}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.66349375},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5265513},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5079437},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.49857116},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.45214966},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45127267},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.44350016},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.43494922},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.374704},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.35831073},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3556499},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26076198},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19505897},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.17999569},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780310001634082","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":15,"referenced_works":["https://openalex.org/W1482777291","https://openalex.org/W1498543354","https://openalex.org/W1601503375","https://openalex.org/W1985123706","https://openalex.org/W1995375901","https://openalex.org/W2026820987","https://openalex.org/W2027020884","https://openalex.org/W2032321507","https://openalex.org/W2034543148","https://openalex.org/W2045148236","https://openalex.org/W2072802070","https://openalex.org/W2079751294","https://openalex.org/W2109039359","https://openalex.org/W2143738202","https://openalex.org/W2295815851"],"related_works":["https://openalex.org/W4302819359","https://openalex.org/W4252122881","https://openalex.org/W2082154838","https://openalex.org/W2047683846","https://openalex.org/W2044902158","https://openalex.org/W2009796757","https://openalex.org/W1973873435","https://openalex.org/W1963627056","https://openalex.org/W1925942709","https://openalex.org/W134055995"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,25,217,253,263,326],"2-Catalog":[3],"Segmentation":[4,20],"problem":[5],"(2-CatSP)":[6],"introduced":[7],"by":[8,153,163,220],"Kleinberg":[9],"et":[10,127,222],"al.":[11,128],"[J.":[12],"Kleinberg,":[13],"C.":[14],"Papadimitriou":[15],"and":[16,59,88,110,133,192,226,293,297,314,318,325,336,338,342],"P.":[17],"Raghavan":[18],"(1998).":[19],"problems.":[21,358],"In":[22,141,202,359],"Proceedings":[23,142],"of":[24,30,42,55,57,143,156,176,184,208,245,252,265,272,311,328,331],"30th":[26],"Symposium":[27],"on":[28,173],"Theory":[29],"Computation,":[31],"pp.":[32,145],"473\u2013482.],":[33],"where":[34],"we":[35,166,204],"are":[36],"given":[37],"a":[38,45,108,115,121,154,174,206,249],"ground":[39],"set":[40],"I":[41,58,78],"n":[43],"items,":[44],"family":[46],"{S":[47],"1,":[48,74],"S":[49,52],"2,":[50],"\u2026,":[51],"m":[53,91],"}":[54],"subsets":[56,72],"an":[60],"integer":[61],"1":[62],"\u2264":[63,65],"k":[64,87,159,177,199,213],"n.":[66],"The":[67,137,181],"objective":[68],"is":[69,102,105,187,193,248],"to":[70,237,261,280],"find":[71],"A":[73,75,95,100,346],"2":[76],"\u2282":[77],"such":[79],"that":[80,107,148],"|A":[81,84],"1|":[82],"=":[83,86,160,214],"2|":[85],"\u2211":[89],"i=1":[90],"max{|S":[92],"i":[93,98],"\u2229":[94,99],"1|,":[96],"|S":[97],"2|}":[101],"maximized.":[103],"It":[104,275],"known":[106],"simple":[109],"elegant":[111],"greedy":[112],"algorithm":[113,186],"has":[114],"performance":[116,182],"guarantee":[117,183],"1/2.":[118],"Furthermore,":[119],"using":[120],"semidefinite":[122],"programming":[123],"(SDP)":[124],"relaxation":[125,218,229],"Doids":[126,221],"[Y.":[129,316],"Doids,":[130],"V.":[131],"Guruswami":[132],"S.":[134],"Khanna":[135],"(1999).":[136],"2-catalog":[138],"segmentation":[139],"problem.":[140],"SODA,":[144],"378\u2013380.]":[146],"showed":[147],"2-CatSP":[149,172,211],"can":[150,276],"be":[151,271,277],"approximated":[152],"factor":[155],"0.56":[157],"when":[158,198,212],"n/2.":[161,215],"Motivated":[162],"these":[164],"results,":[165],"develop":[167],"improved":[168,282,351],"approximation":[169,240,283,352],"algorithms":[170,302,353],"for":[171,189,210,241,284,303,323,349,354],"range":[175],"in":[178,291,307,363],"this":[179,246],"paper.":[180],"our":[185,224],"1/2":[188,197],"general":[190,232],"k,":[191,233],"strictly":[194],"greater":[195],"than":[196],"\u2265":[200],"n/3.":[201],"particular,":[203],"obtain":[205,238,281],"ratio":[207],"0.67":[209],"Unlike":[216],"used":[219,279],"al.,":[223],"extended":[225],"direct":[227],"SDP":[228],"deals":[230],"with":[231],"which":[234,258],"enables":[235],"us":[236,260],"better":[239],"2-CatSP.":[242,266],"Another":[243],"contribution":[244],"paper":[247],"new":[250],"variation":[251],"random":[254],"hyperplane":[255],"rounding":[256,268],"technique,":[257],"allows":[259],"explore":[262],"structure":[264],"This":[267],"technique":[269],"might":[270],"independent":[273],"interest.":[274],"also":[278],"several":[285],"other":[286],"graph":[287,308,356],"partitioning":[288],"problems":[289,305],"considered":[290],"Feige":[292],"Langberg":[294,299],"[U.":[295],"Fiege":[296],"M.":[298],"(2002).":[300],"Approximation":[301,322],"maximization":[304],"arising":[306],"partitioning.":[309],"Journal":[310,330],"Algorithm.],":[312],"Ye":[313,317],"Zhang":[315,320],"J.":[319],"(2003).":[321],"dense-n/2-subgraph":[324],"complement":[327],"min-bisection.":[329],"Global":[332],"Optimization,":[333],"25,":[334],"55\u201373.],":[335],"Halperin":[337,341],"Zwick":[339,344],"[E.":[340],"U.":[343],"(2001).":[345],"unified":[347],"framework":[348],"obtaining":[350],"maximum":[355],"bisection":[357],"IPCO,":[360],"Lecture":[361],"Notes":[362],"Computer":[364],"Science.":[365],"Springer,":[366],"Berlin.].":[367]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2065554317","counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2024-12-12T12:14:22.274572","created_date":"2016-06-24"}