prompt_front: Now, answer the following question based on the text below, only give me the answer and do not output any other words.

Question: Where is McPherson County located?

Read the following text and answer briefly.

Context 1: McPherson County (standard abbreviation: MP) is a county located in the U S  state of Kansas   As of the 2020 census, the county population was 30,223  The largest city and county seat is McPherson  The county is named for Civil War General James B  McPherson 

History

Early history

For many millennia, the Great Plains of North America was inhabited by nomadic Native Americans  From the 16th century to 18th century, the Kingdom of France claimed ownership of large parts of North America  In 1762, after the French and Indian War, France secretly ceded New France to Spain, per the Treaty of Fontainebleau  In 1802, Spain returned most of the land to France, but keeping title to about 7,500 square miles 

In 1803, most of the land for modern day Kansas was acquired by the United States from France as part of the 828,000 square mile Louisiana Purchase for 2 83 cents per acre  In 1848, after the Mexican–American War, the Treaty of Guadalupe Hidalgo with Spain brought into the United States all or part of land for ten future states, including southwest Kansas  In 1854, the Kansas Territory was organized, then in 1861 Kansas became the 34th U S  state 

19th century

From the 1820s to 1870s, the Santa Fe Trail passed through, what is now McPherson County  The trail entered the county, east of Canton, then south of Galva, then north of Inman, and west towards Lyons  In 1855, Charles O  Fuller established a ranch adjacent to the Running Turkey Creek Crossing about two miles south and one mile east of Galva  Fuller's Ranch provided accommodations for travelers on the Santa Fe Trail and was probably the first white settlement in McPherson County 

Peketon County was established in 1860, by the passage of a bill by S  N  Wood:  An act to establish Peketon County  Section 1  - That all that territory west of the sixth principal meridian and south of Township 16, in Kansas Territory, be and the same is hereby erected into a county, to be known by the name of Peketon County  On February 17, 1865, Peketon County was abolished, and McPherson County was made a part of Marion County, which extended from the west line of Chase County to the present western boundary of Kansas 

In 1868, Solomon Stephens and L  N  Holmberg were appointed Justices of the Peace—the first officers in what is now McPherson County  The next year (1869) occurred the first election for the township, now the county of McPherson  McPherson was regularly organized as a county in the spring of 1870, a mass meeting being held at Sweadal  Sweadal, the county seat thus selected, was located about one mile and a half southwest of the present site of Lindsborg  In September, however, the County Commissioners resolved to meet at the latter place, McPherson which had already been located some two years 

In April, 1873, a petition was filed for the county seat re-location  It was signed by 483 voters, and a special election was accordingly ordered for June 10  Upon that day, McPherson received 605 votes, New Gottland 325, King City 3 and Lindsborg 1; McPherson's majority over all, 276  In May the McPherson Town Company had offered, as an inducement for the location of the county seat at this point, the free use of rooms for ten years, and the donation of two squares of land on the town site  The offer was accepted the next month, the County Commissioners selecting blocks 56 and 65  Thus the county seat was established at McPherson and has remained since 

As early as 1875, city leaders of Marion held a meeting to consider a branch railroad from Florence  In 1878, Atchison, Topeka and Santa Fe Railway and parties from Marion County and McPherson County chartered the Marion and McPherson Railway Company   In 1879, a branch line was built from Florence to McPherson, in 1880 it was extended to Lyons, in 1881 it was extended to Ellinwood  The line was leased and operated by the Atchison, Topeka and Santa Fe Railway  The line from Florence to Marion, was abandoned in 1968  In 1992, the line from Marion to McPherson was sold to Central Kansas Railway  In 1993, after heavy flood damage, the line from Marion to McPherson was abandoned  The original branch line connected Florence, Marion, Canada, Hillsboro, Lehigh, Canton, Galva, McPherson, Conway, Windom, Little River, Mitchell, Lyons, Chase, then connected with the original AT&SF main line at Ellinwood 

In 1887, the Chicago, Kansas and Nebraska Railway extended its main line from Herington to Pratt   This main line connected Herington, Ramona, Tampa, Durham, Waldeck, Canton, Galva, McPherson, Groveland, Inman, Medora, Hutchinson, Whiteside, Partridge, Arlington,  Langdon, Turon, Preston, Natrona, Pratt   In 1888, this main line was extended to Liberal   Later, this line was extended to Tucumcari, New Mexico and Santa Rosa, New Mexico, where it made a connection with the Southern Pacific from El Paso, Texas   The Chicago, Kansas and Nebraska Railway was absorbed by the Chicago, Rock Island and Pacific Railway  This line is also called the "Golden State Route" 

20th century
The National Old Trails Road, also known as the Ocean-to-Ocean Highway, was established in 1912, and was routed through Windom, Conway, McPherson 

Geography

According to the U S  Census Bureau, the county has a total area of , of which  is land and  (0 3%) is water 

Adjacent counties
 Saline County (north)
 Dickinson County (northeast)
 Marion County (east)
 Harvey County (southeast)
 Reno County (southwest)
 Rice County (west)
 Ellsworth County (northwest)

Major highways
  Interstate 135
  U S  Route 56
  U S  Route 81
  K-4
  K-61
  K-153

Demographics

The McPherson Micropolitan Statistical Area includes all of McPherson County 

2000 census
As of the census of 2000, there were 29,554 people, 11,205 households, and 7,966 families residing in the county   The population density was 33 people per square mile (13/km2)   There were 11,830 housing units at an average density of 13 per square mile (5/km2)   The racial makeup of the county was 96 53% White, 0 81% Black or African American, 0 34% Native American, 0 32% Asian, 0 06% Pacific Islander, 0 79% from other races, and 1 16% from two or more races   1 94% of the population were Hispanic or Latino of any race  37 1% were of German, 12 9% Swedish, 12 1% American, 6 7% English and 6 3% Irish ancestry according to Census 2000 

There were 11,205 households, out of which 33 00% had children under the age of 18 living with them, 62 50% were married couples living together, 6 00% had a female householder with no husband present, and 28 90% were non-families  25 50% of all households were made up of individuals, and 11 80% had someone living alone who was 65 years of age or older   The average household size was 2 49 and the average family size was 2 99 

In the county, the population was spread out, with 25 40% under the age of 18, 10 30% from 18 to 24, 25 20% from 25 to 44, 21 80% from 45 to 64, and 17 30% who were 65 years of age or older   The median age was 38 years  For every 100 females there were 95 90 males   For every 100 females age 18 and over, there were 92 90 males 

The median income for a household in the county was $41,138, and the median income for a family was $48,243  Males had a median income of $33,530 versus $21,175 for females  The per capita income for the county was $18,921   About 4 20% of families and 6 60% of the population were below the poverty line, including 5 20% of those under age 18 and 8 10% of those age 65 or over 

Government

Presidential elections
McPherson county is often carried by Republican candidates  The last time a Democratic candidate has carried this county was in 1964 by Lyndon B  Johnson 

Laws
Following amendment to the Kansas Constitution in 1986, the county remained a prohibition, or "dry", county until 1996, when voters approved the sale of alcoholic liquor by the individual drink with a 30 percent food sales requirement 

Education

Colleges
 McPherson College in McPherson
 Bethany College in Lindsborg
 Central Christian College in McPherson

Unified school districts
 Smoky Valley USD 400
 McPherson USD 418
 Canton-Galva USD 419
 Moundridge USD 423
 Inman USD 448

School district office in neighboring county
 Goessel USD 411
 Little River-Windom USD 444

Museums
 Birger Sandzén Memorial Gallery in Lindsborg
 McCormick-Deering Days Museum in Inman
 McPherson Museum in McPherson
 Lindsborg Old Mill & Swedish Heritage Museum in Lindsborg
 Kansas Motorcycle Museum in Marquette

Communities

Cities

 Canton
 Galva
 Inman
 Lindsborg
 Marquette
 McPherson (county seat) 
 Moundridge
 Windom

Unincorporated communities
† means a Census-Designated Place (CDP) by the United States Census Bureau 
 Conway
 Elyria†
 Groveland
 Johnstown
 New Gottland
 Roxbury†

Ghost towns
 Alta Mills
 Battle Hill
 Christian
 Doles Park
 Elivon
 King City
 Sweadal

Townships
McPherson County is divided into twenty-five townships   The cities of Lindsborg and McPherson are considered governmentally independent and are excluded from the census figures for the townships   In the following table, the population center is the largest city (or cities) included in that township's population total, if it is of a significant size 

See also
 List of people from McPherson County, Kansas
 National Register of Historic Places listings in McPherson County, Kansas
 McPherson Valley Wetlands
 Maxwell Wildlife Refuge

References

Notes

Further reading

 Wheeler, Wayne Leland  "An Analysis of Social Change in a Swedish-Immigrant Community: The Case of Lindsborg, Kansas " (PhD dissertation, University of Missouri-Columbia; ProQuest Dissertations Publishing, 1959  5905657) 

County
 Through the Years: A Pictorial History of McPherson County; McPherson Sentinel' Heritage House Publishing Co; 1992 
 McPherson County First Courthouse Built About 1869 or 1870; Lindsborg News-Record; March 30, 1959 
 Pioneer Life and Lore of McPherson County, Kansas; Edna Nyquist; Democratic-Opinion Press; 1932 
 A History of the Church of the Brethren in Kansas (includes McPherson College history); Elmer LeRoy Craik; McPherson Daily; Republican Press; 397 pages; 1922 
 Portrait and Biographical Record of Dickinson, Saline, McPherson, and Marion Counties, Kansas; Chapman Bros; 614 pages; 1893 
 Standard Atlas of McPherson County, Kansas; Geo  A  Ogle & Co; 82 pages; 1921 
 Plat Book of McPherson County, Kansas; North West Publishing Co; 50 pages; 1903 
 Edwards' Atlas of McPherson County, Kansas; John P  Edwards; 51 pages; 1884 

Trails
 The Story of the Marking of the Santa Fe Trail by the Daughters of the American Revolution in Kansas and the State of Kansas; Almira Cordry; Crane Co; 164 pages; 1915  (Download 4MB PDF eBook)
 The National Old Trails Road To Southern California, Part 1 (LA to KC); Automobile Club Of Southern California; 64 pages; 1916  (Download 6 8MB PDF eBook)

Mennonite Settlements
 Impact of Mennonite settlement on the cultural landscape of Kansas; Brenda Martin; Kansas State University; 1985/1988  
 Mennonite settlement : the relationship between the physical and cultural environment; Susan Movle; University of Utah; 1975/1886 
 Status of Mennonite women in Kansas in their church and home relationships; Eva Harshbarger; Bluffton College; 1925/1945 

External links

County
 
 McPherson County - Directory of Public Officials
Historical
 , from Hatteberg's People'' on KAKE TV news
Maps
 McPherson County Maps: Current, Historic, KDOT
 Kansas Highway Maps: Current, Historic, KDOT
 Kansas Railroad Maps: Current, 1996, 1915, KDOT and Kansas Historical Society

 
Kansas counties
1867 establishments in Kansas

Context 2: Football Club Urartu (, translated Futbolayin Akumb Urartu), commonly known as Urartu, is an Armenian professional football team based in the capital Yerevan that currently plays in the Armenian Premier League  The club won the Armenian Cup three times, in 1992, 2007 and 2016  In 2013–2014, they won the Armenian Premier League for the first time in their history 

In early 2016, the Russia-based Armenian businessman Dzhevan Cheloyants became a co-owner of the club after purchasing the major part of the club shares  The club was known as FC Banants until 1 August 2019, when it was officially renamed FC Urartu 

History

Kotayk
Urartu FC were founded as FC Banants by Sarkis Israelyan on 21 January 1992 in the village of Kotayk, representing the Kotayk Province  He named the club after his native village of Banants (currently known as Bayan)  Between 1992 and 1995, the club was commonly referred to as Banants Kotayk  During the 1992 season, the club won the first Armenian Cup  At the end of the 1995 transitional season, Banants suffered a financial crisis  The club owners decided that it was better to merge the club with FC Kotayk of Abovyan, rather than disband it  In 2001, Banants demerged from FC Kotayk, and was moved from Abovyan to the capital Yerevan 

Yerevan

FC Banants was relocated to Yerevan in 2001  At the beginning of 2003, Banants merged with FC Spartak Yerevan, but was able to limit the name of the new merger to FC Banants  Spartak became Banants's youth academy and later changed the name to Banants-2  Because of the merger, Banants acquired many players from Spartak Yerevan, including Samvel Melkonyan  After the merger, Banants took a more serious approach and have finished highly in the league table ever since  The club managed to lift the Armenian Cup in 2007 
Experience is making way for youth for the 2008 and 2009 seasons  The departures of most of the experienced players have left the club's future to the youth  Along with two Ukrainian players, Ugandan international, Noah Kasule, has been signed 

The club headquarters are located on Jivani Street 2 of the Malatia-Sebastia District, Yerevan 

Domestic

European

Stadium

The construction of the Banants Stadium was launched in 2006 in the Malatia-Sebastia District of Yerevan, with the assistance of the FIFA goal programme  It was officially opened in 2008 with a capacity of 3,600 seats  Further developments were implemented later in 2011, when the playing pitch was modernized and the capacity of the stadium was increased up to 4,860 seats (2,760 at the northern stand, 1,500 at the southern stand and 600 at the western stand) 

Training centre/academy
Banants Training Centre is the club's academy base located in the Malatia-Sebastia District of Yerevan  In addition to the main stadium, the centre houses 3 full-size training pitches, mini football pitches as well as an indoor facility  The current technical director of the academy is the former Russian footballer Ilshat Faizulin 

Fans
The most active group of fans is the South West Ultras fan club, mainly composed of residents from several neighbourhoods within the Malatia-Sebastia District of Yerevan, since the club is a de facto representer of the district  Members of the fan club benefit from events organized by the club and many facilities of the Banants training centre, such as the mini football pitch, the club store and other entertainments 

Achievements
 Armenian Premier League
 Winner (1): 2013–14 
 Runner-up (5): 2003, 2006, 2007, 2010, 2018 

 Armenian Cup
 Winner (3): 1992, 2007, 2016 
 Runner-up (6): 2003, 2004, 2008, 2009, 2010, 2021–22

 Armenian Supercup
 Winner (1): 2014 
 Runner-up (5): 2004, 2007, 2009, 2010, 2016 

Current squad

Out on loan

Personnel

Technical staff

Management

Urartu-2

FC Banants' reserve squad play as FC Banants-2 in the Armenian First League  They play their home games at the training field with artificial turf of the Urartu Training Centre 

Managerial history
 Varuzhan Sukiasyan (1992–94)
 Poghos Galstyan (July 1, 1996 – June 30, 1998)
 Oganes Zanazanyan (2001–05)
 Ashot Barseghyan (2005–06)
 Nikolay Kiselyov (2006–07)
 Jan Poštulka (2007)
 Nikolay Kostov (July 1, 2007 – April 8, 2008)
 Nedelcho Matushev (April 8, 2008 – June 30, 2008)
 Kim Splidsboel (2008)
 Armen Gyulbudaghyants (Jan 1, 2009 – Dec 1, 2009)
 Ashot Barseghyan (interim) (2009)
 Stevica Kuzmanovski (Jan 1, 2010 – Dec 31, 2010)
 Rafael Nazaryan (Jan 1, 2011 – Jan 15, 2012)
 Volodymyr Pyatenko (Jan 17, 2013 – June 30, 2013)
 Zsolt Hornyák (July 1, 2013 – May 30, 2015)
 Aram Voskanyan (July 1, 2015 – Oct 11, 2015)
 Tito Ramallo (Oct 12, 2015 – Oct 3, 2016)
 Artur Voskanyan (Oct 3, 2016 – Aug 11, 2018)
 Ilshat Faizulin (Aug 12, 2018 –Nov 24, 2019)
 Aleksandr Grigoryan (Nov 25, 2019 –Mar 10, 2021)
 Robert Arzumanyan (10 March 2021–24 June 2022)
 Dmitri Gunko (27 June 2022–)



ground_truth: McPherson County is located in the U.S. state of Kansas.

prompt_front: Now, answer the following question based on the text below, only give me the answer and do not output any other words.

Question: Where is the club's headquarters located?

Read the following text and answer briefly.

Context 4: Paper Info

Title: Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring
Publish Date: 25 Mar 2023
Author List: Loïc Crombez (from LIMOS, Université Clermont Auvergne), Guilherme Da Fonseca (from LIS, Aix-Marseille Université), Florian Fontan (from Independent Researcher), Yan Gerard (from LIMOS, Université Clermont Auvergne), Aldo Gonzalez-Lorenzo (from LIS, Aix-Marseille Université), Pascal Lafourcade (from LIMOS, Université Clermont Auvergne), Luc Libralesso (from LIMOS, Université Clermont Auvergne), Benjamin Momège (from Independent Researcher), Jack Spalding-Jamieson (from David R  Cheriton School of Computer Science, University of Waterloo), Brandon Zhang (from Independent Researcher), Da Zheng (from Department of Computer Science, University of Illinois at Urbana-Champaign)

Figure

Figure 1: A partition of the input graph of the CG:SHOP2022 instance vispecn2518 into 57 plane graphs It is the smallest instance of the challenge with 2518 segments On top left, you see all 57 colors together On top right, you see a clique of size 57, hence the solution is optimal Each of the 57 colors is then presented in small figures 
Figure 2: Number of colors over time for the instance vispecn13806 using different values p The algorithm uses σ = 0 15, easy vertices, q max = 59022, but does not use the BDFS nor any clique 
Figure 3: Number of colors over time with different values of q max obtained on the instance vispecn13806 Parameters are σ = 0 15, p = 1 2, no clique knowledge, and no BDFS 
Figure 4: Number of colors over time with and without clique knowledge and BDFS obtained on the instance vispecn13806 Parameters are σ = 0 15, p = 1 2, and q max = 1500000 
Figure 5: Number of colors over time for the instance vispecn13806 for different values of σ In both figures the algorithm uses p = 1 2, easy vertices, q max = 59022, but does not use the BDFS nor any clique For σ ≥ 0 25, no solution better than 248 colors is found 
Figure 6: Number of colors over time (in hours) for the instance vispecn13806 
Several CG:SHOP 2022 results We compare the size of the largest known clique to the smallest coloring found by each team on a selection of 14 CG:SHOP 2022 instances 
[20][21][22][23][24][25] with state-of-the-art graph coloring algorithms The conflict optimizer underperforms except on the geometric graphs r* and dsjr* CE39-0007), SEVERITAS (ANR-20-CE39-0005) and by the French government IDEX-ISITE initiative 16-IDEX-0001 (CAP[20][21][22][23][24][25] The work of Luc Libralesso is supported by the French ANR PRC grant DECRYPT (ANR-18-CE39-0007) 

abstract

CG:SHOP is an annual geometric optimization challenge and the 2022 edition proposed the problem of coloring a certain geometric graph defined by line segments  Surprisingly, the top three teams used the same technique, called conflict optimization  This technique has been introduced in the 2021 edition of the challenge, to solve a coordinated motion planning problem 
In this paper, we present the technique in the more general framework of binary constraint satisfaction problems (binary CSP)  Then, the top three teams describe their different implementations of the same underlying strategy  We evaluate the performance of those implementations to vertex color not only geometric graphs, but also other types of graphs 

Introduction

The CG:SHOP challenge (Computational Geometry: Solving Hard Optimization Problems) is an annual geometric optimization competition, whose first edition took place in 2019  The 2022 edition proposed a problem called minimum partition into plane subgraphs  The input is a graph G embedded in the plane with edges drawn as straight line segments, and the goal is to partition the set of edges into a small number of plane graphs (Fig  )  
This goal can be formulated as a vertex coloring problem on a graph G defined as follows  The vertices of G are the segments defining the edges of G, and the edges of G correspond to pairs of crossing segments (segments that intersect only at a common endpoint are not considered crossing)  The three top-ranking teams (Lasa, Gitastrophe, and Shadoks) on the CG:SHOP 2022 challenge all used a common approach called conflict optimization while the fourth team used a SAT-Boosted Tabu Search  
Conflict optimization is a technique used by Shadoks to obtain the first place in the CG:SHOP 2021 challenge for low-makespan coordinated motion planning , and the main ideas of the technique lent themselves well to the 2022 challenge  Next, we describe the conflict optimizer as a metaheuristic to solve constraint satisfaction problems (CSP)  
We start by describing a CSP  A CSP is a triple of • variables X = (x 1 ,       , x n ), Each of the 57 colors is then presented in small figures  • domains D = (D 1 ,       , D n ), and • constraints R  Each variable x i must be assigned a value in the corresponding domain D i such that all constraints are satisfied 
In general, the constraints may forbid arbitrary subsets of values  We restrict our attention to a particular type of constraints (binary CSP ), which only involve pairs of assignments  A partial evaluation is an assignment of a subset of the variables, called evaluated, with the remaining variables called non-evaluated 
All constraints involving a non-evaluated variable are satisfied by default  We only consider assignments and partial assignments that satisfy all constraints  The conflict optimizer iteratively modifies a partial evaluation with the goal of emptying the set S of non-evaluated variables, at which point it stops 
At each step, a variable x i is removed from S  If there exists a value x ∈ D i that satisfies all constraints, then we assign the value x to the variable x i   Otherwise, we proceed as follows  For each possible value x ∈ D i , we consider the set K(i, x) of variables (other than x i ) that are part of constraints violated by the assignment x i = x 
We assign to x i the value x that minimizes where w(j) is a weight function to be described later  The variables x j ∈ K(i, x) become non-evaluated and added to S  The weight function should be such that w(j) increases each time x j is added to S, in order to avoid loops that keep moving the same variables back and forth from S  Let q(j) be the number of times x j became non-evaluated 
A possible weight function is w(j) = q(j)  More generally, we can have w(j) = q(j) p for some exponent p (typically between 1 and 2)  Of course, several details of the conflict optimizer are left open  For example, which element to choose from S, whether some random noise should be added to w, and the decision to restart the procedure from scratch after a certain time 
The CSP as is, does not apply to optimization problems  However, we can, impose a maximum value k of the objective function in order to obtain a CSP  The conflict optimizer was introduced in a low makespan coordinated motion planning setting  In that setting, the variables are the robots, the domains are their paths (of length at most k) and the constraints forbid collisions between two paths 
In the graph coloring setting, the domains are the k colors of the vertices and the constraints forbid adjacent vertices from having the same color  The conflict optimizer can be adapted to non-binary CSP, but in that case multiple variables may be unassigned for a single violated constraint  The strategy has some resemblance to the similarly named min-conflicts algorithm , but notable differences are that a partial evaluation is kept instead of an invalid evaluation and the weight function that changes over time 
While the conflict optimization strategy is simple, there are different ways to apply it to the graph coloring problem  The goal of the paper is to present how the top three teams applied it or complemented it with additional strategies  We compare the relative benefits of each variant on the instances given in the CG:SHOP 2022 challenge 
We also compare them to baselines on some instances issued from graph coloring benchmarks  The paper is organized as follows  Section 2 presents the details of the conflict optimization strategy applied to graph coloring  In the three sections that follow, the three teams Lasa, Gitastrophe, and Shadoks present the different parameters and modified strategies that they used to make the algorithm more efficient for the CG:SHOP 2022 challenge 
The last section is devoted to the experimental results 

Literature Review

The study of graph coloring goes back to the 4-color problem (1852) and it has been intensively studied since the 1970s (see for surveys)  Many heuristics have been proposed , as well as exact algorithms   We briefly present two classes of algorithms: greedy algorithms and exact algorithms  Greedy algorithms 
These algorithms are used to find good quality initial solutions in a short amount of time  The classic greedy heuristic considers the vertices in arbitrary order and colors each vertex with the smallest non-conflicting color  The two most famous modern greedy heuristics are DSATUR and Recursive Largest First (RLF )  
At each step (until all vertices are colored), DSATUR selects the vertex v that has the largest number of different colors in its neighbourhood  Ties are broken by selecting a vertex with maximum degree  The vertex v is colored with the smallest non-conflicting color  RLF searches for a large independent set I, assigns the vertices I the same color, removes I from G , and repeats until all vertices are colored 
Exact algorithms  Some exact methods use a branch-and-bound strategy, for example extending the DSATUR heuristic by allowing it to backtrack   Another type of exact method (branch-and-cut-and-price) decomposes the vertex coloring problem into an iterative resolution of two sub-problems   The "master problem" maintains a small set of valid colors using a set-covering formulation 
The "pricing problem" finds a new valid coloring that is promising by solving a maximum weight independent set problem  Exact algorithms are usually able to find the optimal coloring for graphs with a few hundred vertices  However, even the smallest CG:SHOP 2022 competition instances involve at least a few thousands vertices 

Conflict Optimization for Graph Coloring

Henceforth, we will only refer to the intersection conflict graph G induced by the instance  Vertices will refer to the vertices V (G ), and edges will refer to the edges E(G )  Our goal is to partition the vertices using a minimum set of k color classes C = {C 1 ,       , C k }, where no two vertices in the same color class C i are incident to a common edge 

Conflict Optimization

TABUCOL inspired neighbourhood One classical approach for the vertex coloring involves allowing solutions with conflicting vertices (two adjacent vertices with the same color)  It was introduced in 1987 and called TABUCOL  It starts with an initial solution, removes a color (usually the one with the least number of vertices), and assigns uncolored vertices with a new color among the remaining ones 
This is likely to lead to some conflicts (i e  two adjacent vertices sharing a same color)  The local search scheme selects a conflicting vertex, and tries to swap its color, choosing the new coloring that minimises the number of conflicts  If it reaches a state with no conflict, it provides a solution with one color less than the initial solution 
The process is repeated until the stopping criterion is met



ground_truth: The club's headquarters are located on Jivani Street 2 of the Malatia-Sebastia District, Yerevan.

prompt_front: Now, answer the following question based on the text below, only give me the answer and do not output any other words.

Question: What algorithm is engaged in the PLMS-PPIC method?

Read the following text and answer briefly.

Context 3: \section{Introduction}\label{S1}

The multiple access interferences (MAI) is the root of user
limitation in CDMA systems \cite{R1,R3}  The parallel least mean
square-partial parallel interference cancelation (PLMS-PPIC) method
is a multiuser detector for code division multiple access (CDMA)
receivers which reduces the effect of MAI in bit detection  In this
method and similar to its former versions like LMS-PPIC \cite{R5}
(see also \cite{RR5}), a weighted value of the MAI of other users is
subtracted before making the decision for a specific user in
different stages \cite{cohpaper}  In both of these methods, the
normalized least mean square (NLMS) algorithm is engaged
\cite{Haykin96}  The $m^{\rm th}$ element of the weight vector in
each stage is the true transmitted binary value of the $m^{\rm th}$
user divided by its hard estimate value from the previous stage  The
magnitude of all weight elements in all stages are equal to unity 
Unlike the LMS-PPIC, the PLMS-PPIC method tries to keep this
property in each iteration by using a set of NLMS algorithms with
different step-sizes instead of one NLMS algorithm used in LMS-PPIC 
In each iteration, the parameter estimate of the NLMS algorithm is
chosen whose element magnitudes of cancelation weight estimate have
the best match with unity  In PLMS-PPIC implementation it is assumed
that the receiver knows the phases of all user channels  However in
practice, these phases are not known and should be estimated  In
this paper we improve the PLMS-PPIC procedure \cite{cohpaper} in
such a way that when there is only a partial information of the
channel phases, this modified version simultaneously estimates the
phases and the cancelation weights  The partial information is the
quarter of each channel phase in $(0,2\pi)$ 

The rest of the paper is organized as follows: In section \ref{S4}
the modified version of PLMS-PPIC with capability of channel phase
estimation is introduced  In section \ref{S5} some simulation
examples illustrate the results of the proposed method  Finally the
paper is concluded in section \ref{S6} 

\section{Multistage Parallel Interference Cancelation: Modified PLMS-PPIC Method}\label{S4}

We assume $M$ users synchronously send their symbols
$\alpha_1,\alpha_2,\cdots,\alpha_M$ via a base-band CDMA
transmission system where $\alpha_m\in\{-1,1\}$  The $m^{th}$ user
has its own code $p_m( )$ of length $N$, where $p_m(n)\in \{-1,1\}$,
for all $n$  It means that for each symbol $N$ bits are transmitted
by each user and the processing gain is equal to $N$  At the
receiver we assume that perfect power control scheme is applied 
Without loss of generality, we also assume that the power gains of
all channels are equal to unity and users' channels do not change
during each symbol transmission (it can change from one symbol
transmission to the next one) and the channel phase $\phi_m$ of
$m^{th}$ user is unknown for all $m=1,2,\cdots,M$ (see
\cite{cohpaper} for coherent transmission)  According to the above
assumptions the received signal is
\begin{equation}
\label{e1} r(n)=\sum\limits_{m=1}^{M}\alpha_m
e^{j\phi_m}p_m(n)+v(n),~~~~n=1,2,\cdots,N,
\end{equation}
where $v(n)$ is the additive white Gaussian noise with zero mean and
variance $\sigma^2$  Multistage parallel interference cancelation
method uses $\alpha^{s-1}_1,\alpha^{s-1}_2,\cdots,\alpha^{s-1}_M$,
the bit estimates outputs of the previous stage, $s-1$, to estimate
the related MAI of each user  It then subtracts it from the received
signal $r(n)$ and makes a new decision on each user variable
individually to make a new variable set
$\alpha^{s}_1,\alpha^{s}_2,\cdots,\alpha^{s}_M$ for the current
stage $s$  Usually the variable set of the first stage (stage $0$)
is the output of a conventional detector  The output of the last
stage is considered as the final estimate of transmitted bits  In
the following we explain the structure of a modified version of the
PLMS-PIC method \cite{cohpaper} with simultaneous capability of
estimating the cancelation weights and the channel phases 

Assume $\alpha_m^{(s-1)}\in\{-1,1\}$ is a given estimate of
$\alpha_m$ from stage $s-1$  Define
\begin{equation}
\label{e6} w^s_{m}=\frac{\alpha_m}{\alpha_m^{(s-1)}}e^{j\phi_m} 
\end{equation}
From (\ref{e1}) and (\ref{e6}) we have
\begin{equation}
\label{e7} r(n)=\sum\limits_{m=1}^{M}w^s_m\alpha^{(s-1)}_m
p_m(n)+v(n) 
\end{equation}
Define
\begin{subequations}
\begin{eqnarray}
\label{e8} W^s&=&[w^s_{1},w^s_{2},\cdots,w^s_{M}]^T,\\
\label{e9}
\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!\!X^{s}(n)\!\!\!&=&\!\!\![\alpha^{(s-1)}_1p_1(n),\alpha^{(s-1)}_2p_2(n),\cdots,\alpha^{(s-1)}_Mp_M(n)]^T 
\end{eqnarray}
\end{subequations}
where $T$ stands for transposition  From equations (\ref{e7}),
(\ref{e8}) and (\ref{e9}), we have
\begin{equation}
\label{e10} r(n)=W^{s^T}X^{s}(n)+v(n) 
\end{equation}
Given the observations $\{r(n),X^{s}(n)\}^{N}_{n=1}$, in modified
PLMS-PPIC, like the PLMS-PPIC \cite{cohpaper}, a set of NLMS
adaptive algorithm are used to compute
\begin{equation}
\label{te1} W^{s}(N)=[w^{s}_1(N),w^{s}_2(N),\cdots,w^{s}_M(N)]^T,
\end{equation}
which is an estimate of $W^s$ after iteration $N$  To do so, from
(\ref{e6}), we have
\begin{equation}
\label{e13} |w^s_{m}|=1 ~~~m=1,2,\cdots,M,
\end{equation}
which is equivalent to
\begin{equation}
\label{e14} \sum\limits_{m=1}^{M}||w^s_{m}|-1|=0 
\end{equation}
We divide $\Psi=\left(0,1-\sqrt{\frac{M-1}{M}}\right]$, a sharp
range for $\mu$ (the step-size of the NLMS algorithm) given in
\cite{sg2005}, into $L$ subintervals and consider $L$ individual
step-sizes $\Theta=\{\mu_1,\mu_2,\cdots,\mu_L\}$, where
$\mu_1=\frac{1-\sqrt{\frac{M-1}{M}}}{L}, \mu_2=2\mu_1,\cdots$, and
$\mu_L=L\mu_1$  In each stage, $L$ individual NLMS algorithms are
executed ($\mu_l$ is the step-size of the $l^{th}$ algorithm)  In
stage $s$ and at iteration $n$, if
$W^{s}_k(n)=[w^s_{1,k},\cdots,w^s_{M,k}]^T$, the parameter estimate
of the $k^{\rm th}$ algorithm, minimizes our criteria, then it is
considered as the parameter estimate at time iteration $n$  In other
words if the next equation holds
\begin{equation}
\label{e17} W^s_k(n)=\arg\min\limits_{W^s_l(n)\in I_{W^s}
}\left\{\sum\limits_{m=1}^{M}||w^s_{m,l}(n)|-1|\right\},
\end{equation}
where $W^{s}_l(n)=W^{s}(n-1)+\mu_l \frac{X^s(n)}{\|X^s(n)\|^2}e(n),
~~~ l=1,2,\cdots,k,\cdots,L-1,L$ and
$I_{W^s}=\{W^s_1(n),\cdots,W^s_L(n)\}$, then we have
$W^s(n)=W^s_k(n)$, and therefore all other algorithms replace their
weight estimate by $W^{s}_k(n)$  At time instant $n=N$, this
procedure gives $W^s(N)$, the final estimate of $W^s$, as the true
parameter of stage $s$ 

Now consider $R=(0,2\pi)$ and divide it into four equal parts
$R_1=(0,\frac{\pi}{2})$, $R_2=(\frac{\pi}{2},\pi)$,
$R_3=(\pi,\frac{3\pi}{2})$ and $R_4=(\frac{3\pi}{2},2\pi)$  The
partial information of channel phases (given by the receiver) is in
a way that it shows each $\phi_m$ ($m=1,2,\cdots,M$) belongs to
which one of the four quarters $R_i,~i=1,2,3,4$  Assume
$W^{s}(N)=[w^{s}_1(N),w^{s}_2(N),\cdots,w^{s}_M(N)]^T$ is the weight
estimate of the modified algorithm PLMS-PPIC at time instant $N$ of
the stage $s$  From equation (\ref{e6}) we have
\begin{equation}
\label{tt3}
\phi_m=\angle({\frac{\alpha^{(s-1)}_m}{\alpha_m}w^s_m}) 
\end{equation}
We estimate $\phi_m$ by $\hat{\phi}^s_m$, where
\begin{equation}
\label{ee3}
\hat{\phi}^s_m=\angle{(\frac{\alpha^{(s-1)}_m}{\alpha_m}w^s_m(N))} 
\end{equation}
Because $\frac{\alpha^{(s-1)}_m}{\alpha_m}=1$ or $-1$, we have
\begin{eqnarray}
\hat{\phi}^s_m=\left\{\begin{array}{ll} \angle{w^s_m(N)} &
\mbox{if}~
\frac{\alpha^{(s-1)}_m}{\alpha_m}=1\\
\pm\pi+\angle{w^s_m(N)} & \mbox{if}~
\frac{\alpha^{(s-1)}_m}{\alpha_m}=-1\end{array}\right 
\end{eqnarray}
Hence $\hat{\phi}^s_m\in P^s=\{\angle{w^s_m(N)},
\angle{w^s_m(N)+\pi, \angle{w^s_m(N)}-\pi}\}$  If $w^s_m(N)$
sufficiently converges to its true value $w^s_m$, the same region
for $\hat{\phi}^s_m$ and $\phi_m$ is expected  In this case only one
of the three members of $P^s$ has the same region as $\phi_m$  For
example if $\phi_m \in (0,\frac{\pi}{2})$, then $\hat{\phi}^s_m \in
(0,\frac{\pi}{2})$ and therefore only $\angle{w^s_m(N)}$ or
$\angle{w^s_m(N)}+\pi$ or $\angle{w^s_m(N)}-\pi$ belongs to
$(0,\frac{\pi}{2})$  If, for example, $\angle{w^s_m(N)}+\pi$ is such
a member between all three members of $P^s$, it is the best
candidate for phase estimation  In other words,
\[\phi_m\approx\hat{\phi}^s_m=\angle{w^s_m(N)}+\pi \]
We admit that when there is a member of $P^s$ in the quarter of
$\phi_m$, then $w^s_m(N)$ converges  What would happen when non of
the members of $P^s$ has the same quarter as $\phi_m$? This
situation will happen when the absolute difference between $\angle
w^s_m(N)$ and $\phi_m$ is greater than $\pi$  It means that
$w^s_m(N)$ has not converged yet  In this case where we can not
count on $w^s_m(N)$, the expected value is the optimum choice for
the channel phase estimation, e g  if $\phi_m \in (0,\frac{\pi}{2})$
then $\frac{\pi}{4}$ is the estimation of the channel phase
$\phi_m$, or if $\phi_m \in (\frac{\pi}{2},\pi)$ then
$\frac{3\pi}{4}$ is the estimation of the channel phase $\phi_m$ 
The results of the above discussion are summarized in the next
equation
\begin{eqnarray}
\nonumber \hat{\phi}^s_m = \left\{\begin{array}{llll} \angle
{w^s_m(N)} & \mbox{if}~
\angle{w^s_m(N)}, \phi_m\in R_i,~~i=1,2,3,4\\
\angle{w^s_m(N)}+\pi & \mbox{if}~ \angle{w^s_m(N)}+\pi, \phi_m\in
R_i,~~i=1,2,3,4\\
\angle{w^n_m(N)}-\pi & \mbox{if}~ \angle{w^s_m(N)}-\pi, \phi_m\in
R_i,~~i=1,2,3,4\\
\frac{(i-1)\pi+i\pi}{4} & \mbox{if}~ \phi_m\in
R_i,~~\angle{w^s_m(N)},\angle
{w^s_m(N)}\pm\pi\notin R_i,~~i=1,2,3,4 \\
\end{array}\right 
\end{eqnarray}
Having an estimation of the channel phases, the rest of the proposed
method is given by estimating $\alpha^{s}_m$ as follows:
\begin{equation}
\label{tt4}
\alpha^{s}_m=\mbox{sign}\left\{\mbox{real}\left\{\sum\limits_{n=1}^{N}
q^s_m(n)e^{-j\hat{\phi}^s_m}p_m(n)\right\}\right\},
\end{equation}
where
\begin{equation} \label{tt5}
q^{s}_{m}(n)=r(n)-\sum\limits_{m^{'}=1,m^{'}\ne
m}^{M}w^{s}_{m^{'}}(N)\alpha^{(s-1)}_{m^{'}} p_{m^{'}}(n) 
\end{equation}
The inputs of the first stage $\{\alpha^{0}_m\}_{m=1}^M$ (needed for
computing $X^1(n)$) are given by
\begin{equation}
\label{qte5}
\alpha^{0}_m=\mbox{sign}\left\{\mbox{real}\left\{\sum\limits_{n=1}^{N}
r(n)e^{-j\hat{\phi}^0_m}p_m(n)\right\}\right\} 
\end{equation}
Assuming $\phi_m\in R_i$, then
\begin{equation}
\label{qqpp} \hat{\phi}^0_m =\frac{(i-1)\pi+i\pi}{4} 
\end{equation}
Table \ref{tab4} shows the structure of the modified PLMS-PPIC
method  It is to be notified that
\begin{itemize}
\item Equation (\ref{qte5}) shows the conventional bit detection
method when the receiver only knows the quarter of channel phase in
$(0,2\pi)$  \item With $L=1$ (i e  only one NLMS algorithm), the
modified PLMS-PPIC can be thought as a modified version of the
LMS-PPIC method 
\end{itemize}

In the following section some examples are given to illustrate the
effectiveness of the proposed method 

\section{Simulations}\label{S5}

In this section we have considered some simulation examples 
Examples \ref{ex2}-\ref{ex4} compare the conventional, the modified
LMS-PPIC and the modified PLMS-PPIC methods in three cases: balanced
channels, unbalanced channels and time varying channels  In all
examples, the receivers have only the quarter of each channel phase 
Example \ref{ex2} is given to compare the modified LMS-PPIC and the
PLMS-PPIC in the case of balanced channels 

\begin{example}{\it Balanced channels}:
\label{ex2}
\begin{table}
\caption{Channel phase estimate of the first user (example
\ref{ex2})} \label{tabex5} \centerline{{
\begin{tabular}{|c|c|c|c|c|}
\hline
\multirow{6}{*}{\rotatebox{90}{$\phi_m=\frac{3\pi}{8},M=15~~$}} & N(Iteration) & Stage Number& NLMS & PNLMS  \\
&&&&\\
\cline{2-5} & \multirow{2}{*}{64}& s = 2 &  $\hat{\phi}^s_m=\frac{3 24\pi}{8}$ & $\hat{\phi}^s_m=\frac{3 18\pi}{8}$ \\
\cline{3-5} & & s = 3 & $\hat{\phi}^s_m=\frac{3 24\pi}{8}$ & $\hat{\phi}^s_m=\frac{3 18\pi}{8}$ \\
\cline{2-5} & \multirow{2}{*}{256}& s = 2 &  $\hat{\phi}^s_m=\frac{2 85\pi}{8}$ & $\hat{\phi}^s_m=\frac{2 88\pi}{8}$ \\
\cline{3-5} & & s = 3 & $\hat{\phi}^s_m=\frac{2 85\pi}{8}$ & $\hat{\phi}^s_m=\frac{2 88\pi}{8}$ \\
\cline{2-5} \hline
\end{tabular} }}
\end{table}
Consider the system model (\ref{e7}) in which $M$ users
synchronously send their bits to the receiver through their
channels  It is assumed that each user's information consists of
codes of length $N$  It is also assumd that the signal to noise
ratio (SNR) is 0dB  In this example there is no power-unbalanced or
channel loss is assumed  The step-size of the NLMS algorithm in
modified LMS-PPIC method is $\mu=0 1(1-\sqrt{\frac{M-1}{M}})$ and
the set of step-sizes of the parallel NLMS algorithms in modified
PLMS-PPIC method are
$\Theta=\{0 01,0 05,0 1,0 2,\cdots,1\}(1-\sqrt{\frac{M-1}{M}})$,
i e  $\mu_1=0 01(1-\sqrt{\frac{M-1}{M}}),\cdots,
\mu_4=0 2(1-\sqrt{\frac{M-1}{M}}),\cdots,
\mu_{12}=(1-\sqrt{\frac{M-1}{M}})$  Figure~\ref{Figexp1NonCoh}
illustrates the bit error rate (BER) for the case of two stages and
for $N=64$ and $N=256$  Simulations also show that there is no
remarkable difference between results in two stage and three stage
scenarios  Table~\ref{tabex5} compares the average channel phase
estimate of the first user in each stage and over $10$ runs of
modified LMS-PPIC and PLMS-PPIC, when the the number of users is
$M=15$ 
\end{example}

Although LMS-PPIC and PLMS-PPIC, as well as their modified versions,
are structured based on the assumption of no near-far problem
(examples \ref{ex3} and \ref{ex4}), these methods and especially the
second one have remarkable performance in the cases of unbalanced
and/or time varying channels 

\begin{example}{\it Unbalanced channels}:
\label{ex3}
\begin{table}
\caption{Channel phase estimate of the first user (example
\ref{ex3})} \label{tabex6} \centerline{{
\begin{tabular}{|c|c|c|c|c|}
\hline
\multirow{6}{*}{\rotatebox{90}{$\phi_m=\frac{3\pi}{8},M=15~~$}} & N(Iteration) & Stage Number& NLMS & PNLMS  \\
&&&&\\
\cline{2-5} & \multirow{2}{*}{64}& s=2 &  $\hat{\phi}^s_m=\frac{2 45\pi}{8}$ & $\hat{\phi}^s_m=\frac{2 36\pi}{8}$ \\
\cline{3-5} & & s=3 & $\hat{\phi}^s_m=\frac{2 71\pi}{8}$ & $\hat{\phi}^s_m=\frac{2 80\pi}{8}$ \\
\cline{2-5} & \multirow{2}{*}{256}& s=2 &  $\hat{\phi}^s_m=\frac{3 09\pi}{8}$ & $\hat{\phi}^s_m=\frac{2 86\pi}{8}$ \\
\cline{3-5} & & s=3 & $\hat{\phi}^s_m=\frac{2 93\pi}{8}$ & $\hat{\phi}^s_m=\frac{3 01\pi}{8}$ \\
\cline{2-5} \hline
\end{tabular} }}
\end{table}
Consider example \ref{ex2} with power unbalanced and/or channel loss
in transmission system, i e  the true model at stage $s$ is
\begin{equation}
\label{ve7} r(n)=\sum\limits_{m=1}^{M}\beta_m
w^s_m\alpha^{(s-1)}_m c_m(n)+v(n),
\end{equation}
where $0<\beta_m\leq 1$ for all $1\leq m \leq M$  Both the LMS-PPIC
and the PLMS-PPIC methods assume the model (\ref{e7}), and their
estimations are based on observations $\{r(n),X^s(n)\}$, instead of
$\{r(n),\mathbf{G}X^s(n)\}$, where the channel gain matrix is
$\mathbf{G}=\mbox{diag}(\beta_1,\beta_2,\cdots,\beta_m)$  In this
case we repeat example \ref{ex2}  We randomly get each element of
$G$ from $[0,0 3]$  Figure~\ref{Figexp2NonCoh} illustrates the BER
versus the number of users  Table~\ref{tabex6} compares the channel
phase estimate of the first user in each stage and over $10$ runs of
modified LMS-PPIC and modified PLMS-PPIC for $M=15$ 
\end{example}

\begin{example}
\label{ex4} {\it Time varying channels}: Consider example \ref{ex2}
with time varying Rayleigh fading channels  In this case we assume
the maximum Doppler shift of $40$HZ, the three-tap
frequency-selective channel with delay vector of $\{2\times
10^{-6},2 5\times 10^{-6},3\times 10^{-6}\}$sec and gain vector of
$\{-5,-3,-10\}$dB  Figure~\ref{Figexp3NonCoh} shows the average BER
over all users versus $M$ and using two stages 
\end{example}


\section{Conclusion}\label{S6}

In this paper, parallel interference cancelation using adaptive
multistage structure and employing a set of NLMS algorithms with
different step-sizes is proposed, when just the quarter of the
channel phase of each user is known  In fact, the algorithm has been
proposed for coherent transmission with full information on channel
phases in \cite{cohpaper}  This paper is a modification on the
previously proposed algorithm  Simulation results show that the new
method has a remarkable performance for different scenarios
including Rayleigh fading channels even if the channel is
unbalanced 





ground_truth: The normalized least mean square (NLMS) algorithm.