Treffer: Improved exact exponential algorithms for vertex bipartization and other problems

Title:
Improved exact exponential algorithms for vertex bipartization and other problems
Authors:
RAMAN, Venkatesh, SAURABH, Saket, SIKDAR, Somnath
Source:
Theoretical computer science (9th Italian Conference, ICTCS 2005)0ICTCS 2005. :375-389
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 17 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Coupe graphe, Graph cut, Corte grafo, Degré graphe, Graph degree, Grado grafo, Graphe non orienté, Non directed graph, Grafo no orientado, Informatique théorique, Computer theory, Informática teórica, Itinéraire, Route, Itinerario, Méthode séparation et évaluation, Branch and bound method, Método branch and bound, Problème NP difficile, NP hard problem, Problema NP duro, Théorie graphe, Graph theory, Teoría grafo, Tournoi, Tournament, Torneo
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
The Institute of Mathematical Sciences, Chennai, 600113, India
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17437761
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17437761
Database:
PASCAL Archive

Weitere Informationen

We develop efficient exact algorithms for several NP-hard problems including VERTEX BIPARTIZATION, FEEDBACK VERTEX SET, 4-HITTING SET, and MAX CUT in graphs with maximum degree at most 4. Our main results include: - an O* (1.9526n) 1 algorithm for VERTEX BIPARTIZATION problem in undirected graphs; - an O* (1.8384n) algorithm for VERTEX BIPARTIZATION problem in undirected graphs of maximum degree 3; - an O* (1.945n) algorithm for FEEDBACK VERTEX SET and VERTEX BIPARTIZATION problem in undirected graphs of maximum degree 4; - an O* (1.9799n) algorithm for 4-HITTING SET problem; - an O* (1.5541m) algorithm for FEEDBACK ARC SET problem in tournaments. To the best of our knowledge, these are the best known exact algorithms for these problems. In fact, these are the first exact algorithms for these problems with the base of the exponent < 2. En route to these algorithms, we introduce two general techniques for obtaining exact algorithms. One is through parameterized complexity algorithms, and the other is a 'colored' branch-and-bound technique.