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...

Full description

Saved in:
Bibliographic Details
Main Author: Sasatte, Prashant Vishvanath
Format: Dissertation
Language:English
Published: ProQuest Dissertations & Theses 01.01.2006
Subjects:
Mathematics
ISBN:9780494237656, 0494237651
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
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/eLvHCXMwpV07T8MwED5BYQAG3gIKKENXC8dJnHhiAAIDVAwV6ladX6JCSksT-P3EltNWQmJhtLz45PO9vvN3AIOM2rx1e5xwWiBJVYykfUUpUe7DntJMoucteHvOh8NiPBavoTenDm2VnU30hlrPlKuR3zg4iPE2P7idfxI3NMqBq2GCxiZsucDGUec_rkc_q2Q9Fb79I4s7zp2w5r9MsPcr5f4_T3QAe_drePohbJjqCHZfllSs9TEMytY_SVQfUW2aKMyPqaNpFTVejfwXtxMYlQ-juycSRiOQ91QUxMYyN8JmiXK0kK4UobSymHMRS4ocNYu1CxwKhTTJkCnDtKNpkSi1YJonp9CrZpU5g8hYYVJjKGqu21TEYkEtSsmNQ-hUnp9Dv5N-EtS7nixFv_hztw87q4rFJfSaxZe5gm313UzrxbW_rB-eQp4P
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB5qFXwcfKPWRw71uJhskk1yEA_W2tK0eCjSW9gnFiHVJir-J3-kuzFpC4K3HjwuC8syszOz8_oGoOnbKtBmjyBihxR53KFIS5GHuGnY4wIzWuAWPMbBYBCORtFDDb6qXhhTVlnpxEJRiwk3MfIrkw7CRPsHNy-vyAyNMsnVaoLGz6voyc8P7bFl192WZu8lxu274W0HlUMF0JMXhUg5LJCR8l1uABWNE88FVzQgkcNsSqjAjjAmN-TUdn2KucTCAJwwykSEBXH1sSuw6rmBYwoI7xc_W_PYgBcV1Sa-U0H8lGvyS-MXZqy9_b8IsANbrYVqgV2oyXQPNvszoNlsH5ptbX0Z5c9WJnOrnI6TWePUygshKRr4DmC4jCseQj2dpPIILKki6UlpU0GEdrQUDW1FGSPS5B95EBxDoyJ2UgpvlswoffLn7gWsd4b9OIm7g14DNuaxmVOo59M3eQZr_D0fZ9Pz4p1YkCyZLd_iBvpU
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