Feedback set problems in tournaments
In this thesis we study the feedback set problems in directed graphs. The feedback set problems deal with destroying (directed) cycles in (directed) graphs using a minimum number of vertex or edge removals. These problems originated from applications in combinatorial circuit design, but have found t...
Uložené v:
| Hlavný autor: | |
|---|---|
| Médium: | Dissertation |
| Jazyk: | English |
| Vydavateľské údaje: |
ProQuest Dissertations & Theses
01.01.2006
|
| Predmet: | |
| ISBN: | 9780494237656, 0494237651 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | In this thesis we study the feedback set problems in directed graphs. The feedback set problems deal with destroying (directed) cycles in (directed) graphs using a minimum number of vertex or edge removals. These problems originated from applications in combinatorial circuit design, but have found their way into numerous other applications such as deadlock prevention in operating systems, constraint satisfaction and bayesian inference in artificial intelligence and graph drawing. Therefore, in recent years feedback set problems have been the subject of growing interest and there have been intensive efforts on exact and approximation algorithms for these kinds of problems. This thesis focuses on feedback set problems in a special class of directed graphs, tournament and bipartite tournament, which appear in applications such as voting systems, rankings, and graph drawing. We briefly survey the best known hardness results, parameterized complexity results, and approximation algorithms for feedback set problems in a tournament. For a bipartite tournament, we present an improved 3-approximation algorithm and an improved O(3kn2) time FPT algorithm for the feedback vertex set problem in a bipartite tournament. We also present some new results concerning the computational complexity of the feedback arc set problem in a bipartite tournament and provide an improved FPT algorithm for the feedback arc set problem in a bipartite tournament. Keywords: Feedback Set Problem, Tournament, Parameterized Complexity, FPT algorithm, kernelization, Linear programming, Approximation Algorithm, Iterative Rounding. |
|---|---|
| AbstractList | In this thesis we study the feedback set problems in directed graphs. The feedback set problems deal with destroying (directed) cycles in (directed) graphs using a minimum number of vertex or edge removals. These problems originated from applications in combinatorial circuit design, but have found their way into numerous other applications such as deadlock prevention in operating systems, constraint satisfaction and bayesian inference in artificial intelligence and graph drawing. Therefore, in recent years feedback set problems have been the subject of growing interest and there have been intensive efforts on exact and approximation algorithms for these kinds of problems. This thesis focuses on feedback set problems in a special class of directed graphs, tournament and bipartite tournament, which appear in applications such as voting systems, rankings, and graph drawing. We briefly survey the best known hardness results, parameterized complexity results, and approximation algorithms for feedback set problems in a tournament. For a bipartite tournament, we present an improved 3-approximation algorithm and an improved O(3kn2) time FPT algorithm for the feedback vertex set problem in a bipartite tournament. We also present some new results concerning the computational complexity of the feedback arc set problem in a bipartite tournament and provide an improved FPT algorithm for the feedback arc set problem in a bipartite tournament. Keywords: Feedback Set Problem, Tournament, Parameterized Complexity, FPT algorithm, kernelization, Linear programming, Approximation Algorithm, Iterative Rounding. |
| Author | Sasatte, Prashant Vishvanath |
| Author_xml | – sequence: 1 givenname: Prashant surname: Sasatte middlename: Vishvanath fullname: Sasatte, Prashant Vishvanath |
| BookMark | eNotzkuLwjAUBeDAKMyo_Q9lcFu4TdokdzmILxDcuJeb5BYfNZ0x9f9PUVcHDpzDNxGj2EX-EBkaCxVWUhld60-RpXR2AIBKQSW_xHzFHBz5a564z3_vnWv5lvJzzPvucY9049inmRg31CbO3jkVh9XysNgUu_16u_jZFacKbdGUzjA2tfIWLIDRpQ--IaOxdECagiwDSKusJ1A1Sc8y4FA4cgFl0Goqvl-3A-Pvwak_Xp6GNh0HLEpth_U_LI89Gg |
| ContentType | Dissertation |
| Copyright | Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works. |
| Copyright_xml | – notice: Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works. |
| DBID | 053 0BH 0HZ 0PZ CBPLH EU9 G20 M8- PHGZT PKEHL PQEST PQQKQ PQUKI |
| DatabaseName | Dissertations & Theses Europe Full Text: Science & Technology ProQuest Dissertations and Theses Professional Dissertations & Theses @ Library and Archives Canada Dissertations & Theses @ University of Waterloo ProQuest Dissertations & Theses Global: The Sciences and Engineering Collection ProQuest Dissertations & Theses A&I ProQuest Dissertations & Theses Global ProQuest Dissertations and Theses A&I: The Sciences and Engineering Collection ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic (retired) ProQuest One Academic UKI Edition |
| DatabaseTitle | Dissertations & Theses @ University of Waterloo ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition ProQuest Dissertations & Theses Global: The Sciences and Engineering Collection ProQuest Dissertations and Theses Professional ProQuest Dissertations and Theses A&I: The Sciences and Engineering Collection ProQuest Dissertations & Theses Global Dissertations & Theses Europe Full Text: Science & Technology Dissertations & Theses @ Library and Archives Canada ProQuest One Academic UKI Edition ProQuest One Academic ProQuest Dissertations & Theses A&I ProQuest One Academic (New) |
| DatabaseTitleList | Dissertations & Theses @ University of Waterloo |
| Database_xml | – sequence: 1 dbid: G20 name: ProQuest Dissertations & Theses Global url: https://www.proquest.com/pqdtglobal1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| ExternalDocumentID | 1288650911 |
| Genre | Dissertation/Thesis |
| GroupedDBID | 053 0BH 0HZ 0PZ 123 8R4 8R5 CBPLH EU9 G20 M8- PHGZT PKEHL PQEST PQQKQ PQUKI Q2X |
| ID | FETCH-LOGICAL-h498-f1b7e9f53c80800761cdcfa7691b0a6ad21d02838ca035a2ce2d9028babd92d63 |
| IEDL.DBID | G20 |
| ISBN | 9780494237656 0494237651 |
| IngestDate | Mon Jun 30 05:33:50 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-h498-f1b7e9f53c80800761cdcfa7691b0a6ad21d02838ca035a2ce2d9028babd92d63 |
| Notes | SourceType-Dissertations & Theses-1 ObjectType-Dissertation/Thesis-1 content type line 12 |
| PQID | 304926828 |
| PQPubID | 18750 |
| ParticipantIDs | proquest_journals_304926828 |
| PublicationCentury | 2000 |
| PublicationDate | 20060101 |
| PublicationDateYYYYMMDD | 2006-01-01 |
| PublicationDate_xml | – month: 01 year: 2006 text: 20060101 day: 01 |
| PublicationDecade | 2000 |
| PublicationYear | 2006 |
| Publisher | ProQuest Dissertations & Theses |
| Publisher_xml | – name: ProQuest Dissertations & Theses |
| SSID | ssib000933042 |
| Score | 1.432977 |
| Snippet | In this thesis we study the feedback set problems in directed graphs. The feedback set problems deal with destroying (directed) cycles in (directed) graphs... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| SubjectTerms | Mathematics |
| Title | Feedback set problems in tournaments |
| URI | https://www.proquest.com/docview/304926828 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwED5BYQAG3gIKKEPXiNiO7XhiACoGqBgq1K3yK6JCSqEO_H5sy2krIbEwWh78Ot_77gMYVJZookJemJcOecmM_1K08FYKMYQrXOMiQrK8PvHRqJpMxEvKzXEprbLjiZFRm7kOPvKbEA7CzNsHtx-feQCNCsHVhKCxCVu88kuEWt917WdlrJcipn9Q1PXcSWP2iwVHuTLc_-eODmDvfi2efggbtjmC3edlK1Z3DIOhl09K6vfM2TZL-DEumzVZG8kolridwHj4ML57zBM0Qv5WiiqvkeJW1JTo0BYyuCK00bXkTCBVSCYNRiYoDpWWBaESa4tNaNOipDICG0ZOodfMG3sGmVe4FJakZtqrTowqgWrurxJr5S07RNU59LvTTxN5u-ny6Bd_zvZhZ-WxuIReu_iyV7Ctv9uZW1zHx_oBRNGb0Q |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB5qFXwcfKPWRw71GMzuJpvkIB6staVp8VCkt7CvYBFSbaLif_JHuhuTtiB468HjEljC7Ly-2dn5AJqBIoJw0xemo4PtUqlNynM0SiGS-Bwn2CkoWR4jfzAIRqPwoQZf1VsY01ZZ-cTCUcuJMDXyK3MdhKnGBzcvr7YhjTKXqxWDxo9W9NTnh0Zs2XW3pY_3EuP23fC2Y5ekAvaTGwZ2grivwsQjwgxUNCBeSJEwn4aIO4wyiZE0ITcQzCEew0JhaQaccMZliCUletsVWHWJj0wD4f1isjWvDbhh0W3ioWrET7mmvzx-Ecba2_9LADuw1VroFtiFmkr3YLM_GzSb7UOzraMvZ-LZylRulew4mTVOrbwwkuIB3wEMl_GLh1BPJ6k6AkunkxwzklChE0Pq8RAlvtZFLLjGrcjjx9CohB2XxpvFM0mf_Pn1AtY7w34UR91BrwEb89rMKdTz6Zs6gzXxno-z6XmhJxbESz6Wb6c5-AQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adissertation&rft.genre=dissertation&rft.title=Feedback+set+problems+in+tournaments&rft.DBID=053%3B0BH%3B0HZ%3B0PZ%3BCBPLH%3BEU9%3BG20%3BM8-%3BPHGZT%3BPKEHL%3BPQEST%3BPQQKQ%3BPQUKI&rft.PQPubID=18750&rft.au=Sasatte%2C+Prashant+Vishvanath&rft.date=2006-01-01&rft.pub=ProQuest+Dissertations+%26+Theses&rft.isbn=9780494237656&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=1288650911 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780494237656/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780494237656/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780494237656/sc.gif&client=summon&freeimage=true |