{"id":"https://openalex.org/W2093866354","doi":"https://doi.org/10.1137/0614066","title":"Constructive Heuristics and Lower Bounds for Graph Partitioning Based on a Principal-Components Approximation","display_name":"Constructive Heuristics and Lower Bounds for Graph Partitioning Based on a Principal-Components Approximation","publication_year":1993,"publication_date":"1993-10-01","ids":{"openalex":"https://openalex.org/W2093866354","doi":"https://doi.org/10.1137/0614066","mag":"2093866354"},"language":"en","primary_location":{"id":"doi:10.1137/0614066","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0614066","pdf_url":null,"source":{"id":"https://openalex.org/S16958353","display_name":"SIAM Journal on Matrix Analysis and Applications","issn_l":"0895-4798","issn":["0895-4798","1095-7162"],"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 Matrix Analysis and Applications","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/A5001813486","display_name":"K.S. Arun","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"K. S. Arun","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5112780826","display_name":"Vasant B. Rao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"V. B. Rao","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001813486"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5537,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.72877423,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"14","issue":"4","first_page":"991","last_page":"1015"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9896000027656555,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7146589756011963},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6826735138893127},{"id":"https://openalex.org/keywords/strength-of-a-graph","display_name":"Strength of a graph","score":0.5295589566230774},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4332354962825775},{"id":"https://openalex.org/keywords/null-graph","display_name":"Null graph","score":0.41665664315223694},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4150150716304779},{"id":"https://openalex.org/keywords/complement-graph","display_name":"Complement graph","score":0.41424959897994995},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.410857617855072},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4076431095600128},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3408840298652649},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.29157090187072754},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.26299282908439636},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2244684100151062}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7146589756011963},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6826735138893127},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.5295589566230774},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4332354962825775},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.41665664315223694},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4150150716304779},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.41424959897994995},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.410857617855072},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4076431095600128},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3408840298652649},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.29157090187072754},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.26299282908439636},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2244684100151062}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0614066","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0614066","pdf_url":null,"source":{"id":"https://openalex.org/S16958353","display_name":"SIAM Journal on Matrix Analysis and Applications","issn_l":"0895-4798","issn":["0895-4798","1095-7162"],"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 Matrix Analysis and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1534416612","https://openalex.org/W1575147392","https://openalex.org/W1577506665","https://openalex.org/W1985912810","https://openalex.org/W2000389722","https://openalex.org/W2024060531","https://openalex.org/W2029282358","https://openalex.org/W2030087828","https://openalex.org/W2033852356","https://openalex.org/W2037402401","https://openalex.org/W2071609006","https://openalex.org/W2114030927","https://openalex.org/W2147542748","https://openalex.org/W2157211828","https://openalex.org/W2161455936","https://openalex.org/W2294798173","https://openalex.org/W2313220223","https://openalex.org/W2586673923","https://openalex.org/W4249958171"],"related_works":["https://openalex.org/W2065982392","https://openalex.org/W2024517697","https://openalex.org/W1981890243","https://openalex.org/W2072977082","https://openalex.org/W1040622739","https://openalex.org/W1969080501","https://openalex.org/W2169615079","https://openalex.org/W3157697337","https://openalex.org/W2089494972","https://openalex.org/W2030795846","https://openalex.org/W1572923929","https://openalex.org/W2094826544","https://openalex.org/W2264650281","https://openalex.org/W2001281476","https://openalex.org/W2054806204","https://openalex.org/W2166321766","https://openalex.org/W1573782722","https://openalex.org/W2565718665","https://openalex.org/W2150334609","https://openalex.org/W1970076003"],"abstract_inverted_index":{"This":[0,37],"paper":[1,71,202],"addresses":[2],"the":[3,7,25,28,48,55,80,86,111,118,137,142,147,150,182,214,218,240,243,247,255,258,267,278,285,304,313,316,320],"problem":[4,38,88,92],"of":[5,10,18,27,75,82,85,93,97,103,126,139,149,181,188,213,257,299,306,311,315],"partitioning":[6],"vertex":[8],"set":[9,96,125],"an":[11,233],"edge-weighted":[12],"undirected":[13],"graph":[14,49,87,143,154,215,286],"into":[15],"two":[16,272,279],"parts":[17],"specified":[19],"sizes":[20,281,301],"so":[21],"as":[22,221,232],"to":[23,89,123,223,263,266],"minimize":[24],"sum":[26],"weights":[29],"on":[30,79,254,295],"edges":[31],"joining":[32],"Vertices":[33],"in":[34,46,99,141,165,200,206,309],"different":[35,300],"parts.":[36],"is":[39,51,66,77,115,136,146,195],"NP-hard":[40],"and":[41,54,63,144,246,319],"has":[42,289],"several":[43],"important":[44],"applications":[45],"which":[47],"size":[50,112],"typically":[52],"large":[53,178],"brute-force":[56],"approach":[57],"(of":[58],"listing":[59],"all":[60,106,162],"feasible":[61,107,211,230],"partitions":[62,108,164],"comparing":[64],"costs)":[65],"computationally":[67],"prohibitive.":[68],"In":[69],"this":[70,201],"a":[72,83,90,95,124,186,210,229],"new":[73],"class":[74],"algorithms":[76,198,205,225,237],"developed":[78,159],"basis":[81],"transformation":[84],"geometric":[91],"clustering":[94],"points":[98],"Euclidean":[100],"space.":[101],"Instead":[102],"searching":[104],"through":[105],"that":[109,117,207,226],"meet":[110],"specifications,":[113],"it":[114],"shown":[116],"search":[119],"can":[120],"be":[121,264],"confined":[122],"$n^{p(":[127],"p":[128,145,168],"+":[129,169],"1":[130],")/2}":[131],"$":[132],"partitions,":[133],"where":[134],"n":[135],"number":[138],"vertices":[140],"rank":[148,190],"$n":[151],"\\times":[152],"n$":[153],"connection":[155,183,219,287],"matrix.":[156],"Procedures":[157],"are":[158,203,261,282],"for":[160,271],"constructing":[161],"such":[163],"$O(":[166],"n^{p(":[167],"3":[170],")":[171],"/2}":[172],")$":[173],"time.":[174],"For":[175],"matrices":[176],"with":[177],"ranks,":[179],"approximation":[180],"matrix":[184,187,288],"by":[185,191],"low":[189],"using":[192],"principal-components":[193],"analysis":[194],"suggested.":[196],"The":[197,236],"presented":[199],"constructive":[204],"they":[208],"generate":[209],"partition":[212,231,260,318],"directly":[216],"from":[217,228],"matrix,":[220],"opposed":[222],"iterative":[224],"start":[227],"initial":[234],"guess.":[235],"also":[238],"bound":[239,270,322],"difference":[241],"between":[242],"achieved":[244],"cost":[245,256,314],"lowest":[248],"achievable":[249],"cost.":[250],"These":[251],"lower":[252,269,321],"bounds":[253],"optimal":[259],"proved":[262],"superior":[265],"Donath\u2013Hoffman":[268],"significant":[273],"special":[274],"cases":[275],"wherein":[276],"either":[277],"part":[280],"equal":[283,290],"or":[284],"row":[291],"sums.":[292],"Simulation":[293],"results":[294],"randomly":[296],"constructed":[297,317],"graphs":[298],"clearly":[302],"demonstrate":[303],"effectiveness":[305],"these":[307],"heuristics":[308],"terms":[310],"both":[312],"provided.":[323]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}