Open problems around exact algorithms

We list a number of open questions around worst case time bounds and worst case space bounds for NP-hard problems. We are interested in exponential time solutions for these problems with a relatively good worst case behavior. We summarize what is known on these problems, we discuss related results,...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Discrete Applied Mathematics Ročník 156; číslo 3; s. 397 - 405
Hlavný autor: Woeginger, Gerhard J.
Médium: Journal Article Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: Lausanne Elsevier B.V 01.02.2008
Amsterdam Elsevier
New York, NY
Predmet:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Combinatorial optimization
Combinatorics
Combinatorics. Ordered structures
Computational complexity
Computer science; control theory; systems
Exact sciences and technology
Mathematics
Sciences and techniques of general use
Theoretical computing
Combinatorial optimization
Computational complexity
Computer theory
NP hard problem
Pointer
Behavior
Combinatorics
Algorithm
ISSN:0166-218X, 1872-6771
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract We list a number of open questions around worst case time bounds and worst case space bounds for NP-hard problems. We are interested in exponential time solutions for these problems with a relatively good worst case behavior. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature.
AbstractList We list a number of open questions around worst case time bounds and worst case space bounds for NP-hard problems. We are interested in exponential time solutions for these problems with a relatively good worst case behavior. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature.
Author Woeginger, Gerhard J.
Author_xml – sequence: 1
  givenname: Gerhard J.
  surname: Woeginger
  fullname: Woeginger, Gerhard J.
  email: gwoegi@win.tue.nl
  organization: Department of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20222689$$DView record in Pascal Francis
BookMark eNp9kE1LxDAQhoMouLv6A7z1ssfWybRNuniSxS9Y2IuCt5DmQ7O0TUmq6L83y-rFw56GGd7nhXnm5HTwgyHkikJBgbLrXaFlXyAAL6AsAMsTMqMNx5xxTk_JLGVYjrR5PSfzGHcAQNM2I8vtaIZsDL7tTB8zGfzHoDPzJdWUye7NBze99_GCnFnZRXP5Oxfk5f7uef2Yb7YPT-vbTa5KDlPOVrql2tK6KXlVqbpeYc3aGipjG0t5xRulVKuZRtAodatKaC3WgJanS4vlgiwPvaOMSnY2yEG5KMbgehm-BQIismaVcvyQU8HHGIwVyk1ycn6YgnSdoCD2VsROJCtib0VAKZKVRNJ_5F_5MebmwJj0-qczQUTlzKCMdsGoSWjvjtA_GMp7QA
CODEN DAMADU
CitedBy_id crossref_primary_10_1007_s00453_022_01034_7
crossref_primary_10_1145_3450524
crossref_primary_10_1007_s11128_023_03962_x
crossref_primary_10_1007_s00453_011_9576_4
crossref_primary_10_1145_3186893
crossref_primary_10_1016_j_jda_2009_08_001
crossref_primary_10_1007_s11265_020_01550_1
crossref_primary_10_1016_j_ejor_2025_05_024
crossref_primary_10_1137_16M1061771
crossref_primary_10_1002_jgt_22225
crossref_primary_10_1016_j_cor_2012_02_024
crossref_primary_10_1137_22M1469122
crossref_primary_10_1007_s10474_018_0817_8
crossref_primary_10_1002_jgt_21631
crossref_primary_10_1007_s00453_014_9883_7
crossref_primary_10_1145_3381878
crossref_primary_10_1103_PRXQuantum_2_030345
crossref_primary_10_1007_s00453_012_9694_7
crossref_primary_10_1016_j_tcs_2025_115424
crossref_primary_10_1103_PRXQuantum_2_020101
crossref_primary_10_1109_ACCESS_2018_2816605
crossref_primary_10_1007_s00453_012_9672_0
crossref_primary_10_1016_j_tcs_2010_06_026
Cites_doi 10.1007/BF01753703
10.1137/0209046
10.1017/S0013091500009639
10.1016/0020-0190(93)90033-6
10.1007/978-3-540-27836-8_101
10.1006/jcom.1998.0476
10.1016/0020-0190(76)90065-X
10.1016/j.mathsocsci.2004.06.002
10.1016/0925-7721(95)00022-2
10.1137/0207033
10.1016/S0020-0190(96)00159-7
10.1007/978-1-4612-0515-9
10.1007/3-540-36478-1_17
10.1145/210332.210337
10.1016/0020-0190(94)00151-0
10.1006/jcom.1997.0438
10.1007/3-540-52292-1_16
10.1007/BF01228511
10.1016/S0166-218X(00)00339-5
10.1137/0206038
10.1016/j.tcs.2004.05.009
10.1051/ita/1986200100791
10.1137/0211056
10.1145/321812.321823
10.1016/0167-6377(82)90044-X
10.1016/0304-3975(94)00097-3
10.1016/S0747-7171(08)80013-2
10.1016/0022-0000(78)90026-0
10.1137/0210033
10.1137/0136016
10.1145/800061.808735
10.1016/0196-6774(86)90032-5
ContentType Journal Article
Conference Proceeding
Copyright 2007
2008 INIST-CNRS
Copyright_xml – notice: 2007
– notice: 2008 INIST-CNRS
DBID 6I.
AAFTH
AAYXX
CITATION
IQODW
DOI 10.1016/j.dam.2007.03.023
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Applied Sciences
EISSN 1872-6771
EndPage 405
ExternalDocumentID 20222689
10_1016_j_dam_2007_03_023
S0166218X0700128X
GroupedDBID -~X
6I.
AAFTH
ADEZE
AFTJW
AI.
ALMA_UNASSIGNED_HOLDINGS
FA8
FDB
OAUVE
VH1
WUQ
AAYXX
CITATION
IQODW
ID FETCH-LOGICAL-c370t-69db1df1583744c559256b504ef8f17478cccbd6d20d2adbc30bf2502f720db23
ISICitedReferencesCount 53
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000253370100009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0166-218X
IngestDate Sun Oct 22 16:03:31 EDT 2023
Tue Nov 18 22:03:04 EST 2025
Sat Nov 29 02:59:26 EST 2025
Sat Apr 29 22:44:07 EDT 2023
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords Combinatorial optimization
Computational complexity
Computer theory
NP hard problem
Pointer
Behavior
Combinatorics
Algorithm
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
https://www.elsevier.com/tdm/userlicense/1.0
https://www.elsevier.com/open-access/userlicense/1.0
CC BY 4.0
LinkModel OpenURL
MeetingName Combinatorial Optimization 2004
MergedId FETCHMERGED-LOGICAL-c370t-69db1df1583744c559256b504ef8f17478cccbd6d20d2adbc30bf2502f720db23
OpenAccessLink https://dx.doi.org/10.1016/j.dam.2007.03.023
PageCount 9
ParticipantIDs pascalfrancis_primary_20222689
crossref_citationtrail_10_1016_j_dam_2007_03_023
crossref_primary_10_1016_j_dam_2007_03_023
elsevier_sciencedirect_doi_10_1016_j_dam_2007_03_023
PublicationCentury 2000
PublicationDate 2008-02-01
PublicationDateYYYYMMDD 2008-02-01
PublicationDate_xml – month: 02
  year: 2008
  text: 2008-02-01
  day: 01
PublicationDecade 2000
PublicationPlace Lausanne
Amsterdam
New York, NY
PublicationPlace_xml – name: Amsterdam
– name: Lausanne
– name: New York, NY
PublicationTitle Discrete Applied Mathematics
PublicationYear 2008
Publisher Elsevier B.V
Elsevier
Publisher_xml – name: Elsevier B.V
– name: Elsevier
References Lipton, Tarjan (bib32) 1980; 9
D. Eppstein, The traveling salesman problem for cubic graphs, in: Proceedings of the 8th International Workshop on Algorithms and Data Structures (WADS’2003), Lecture Notes in Computer Science, vol. 2748, 2003, pp. 307–318.
Gajentaan, Overmars (bib20) 1995; 5
J. Erickson, Private communication, 2004.
Schwikowski, Speckenmeyer (bib38) 2002; 117
Karp (bib28) 1982; 1
R. Beigel, Finding maximum independent sets in sparse and general graphs, in: Proceedings of the 10th ACM–SIAM Symposium on Discrete Algorithms (SODA’1999), 1999, pp. 856–857.
Robson (bib36) 1986; 7
W.D. Smith, Studies in computational geometry motivated by mesh generation. Ph.D. Thesis, Princeton University, Princeton.
U. Feige, J. Kilian, On limited versus polynomial nondeterminism, Chicago J. Theoret. Comput. Sci., 1997.
Held, Karp (bib21) 1962; 10
Fedin, Kulikov (bib18) 2002; 293
Tarjan, Trojanowski (bib41) 1977; 6
Bax (bib5) 1994; 52
Erickson (bib16) 1999; 1999
B. Klinz, G.J. Woeginger, Faster algorithms for computing power indices in weighted majority games, Math. Social Sci., 2004.
G.J. Woeginger, Exact algorithms for NP-hard problems: a survey, in: Combinatorial Optimization—Eureka, you shrink!”, Lecture Notes in Computer Science, vol. 2570, Springer, Berlin, 2003, pp. 185–207.
Huang, Pan (bib23) 1998; 14
Nešetřil, Poljak (bib34) 1985; 26
Downey, Fellows (bib13) 1999
R. Williams, A new algorithm for optimal constraint satisfaction and its implications, in: Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP’2004), Springer, Berlin, 2004.
Prasad, Kelly (bib35) 1990; 19
Horowitz, Sahni (bib22) 1974; 21
Bax, Franklin (bib6) 1996; 60
Itai, Rodeh (bib26) 1978; 7
Hwang, Chang, Lee (bib24) 1993; 9
Alon, Yuster, Zwick (bib2) 1995; 42
Itai, Papadimitriou, Swarcfiter (bib25) 1982; 11
M. Ben-Or, Lower bounds for algebraic computation trees. in: Proceedings of the 15th Annual ACM Symposium on the Theory of Computing (STOC’1983), 1983, pp. 80–86.
Lawler (bib30) 1976; 5
Lipton, Tarjan (bib31) 1979; 36
E. Speckenmeyer, On feedback problems in digraphs, in: Proceedings of the 15th Workshop on Graph-Theoretic Concepts in Computer Science (WG’1989), Lecture Notes in Computer Science, vol. 411, Springer, Berlin, 1989, pp. 218–231.
Afrati, Cosmadakis, Papadimitriou, Papageorgiou, Papakonstantinou (bib1) 1986; 20
Bax (bib4) 1993; 47
Downey, Fellows (bib12) 1995; 141
Banzhaf III (bib3) 1965; 19
Moon (bib33) 1971; 17
Schroeppel, Shamir (bib37) 1981; 10
V. Kann, On the approximability of NP-complete optimization problems, Ph.D. Thesis, Kungliga Tekniska Högskolan, Stockholm, 1992.
Coppersmith (bib9) 1997; 13
Coppersmith, Winograd (bib10) 1990; 9
Dobkin, Lipton (bib11) 1978; 16
F. Eisenbrand, F. Grandoni, On the complexity of fixed parameter clique and dominating set. Theoret. Comput. Sci., 2004.
Gajentaan (10.1016/j.dam.2007.03.023_bib20) 1995; 5
Hwang (10.1016/j.dam.2007.03.023_bib24) 1993; 9
Downey (10.1016/j.dam.2007.03.023_bib13) 1999
10.1016/j.dam.2007.03.023_bib43
Lipton (10.1016/j.dam.2007.03.023_bib31) 1979; 36
Coppersmith (10.1016/j.dam.2007.03.023_bib9) 1997; 13
10.1016/j.dam.2007.03.023_bib7
10.1016/j.dam.2007.03.023_bib8
Itai (10.1016/j.dam.2007.03.023_bib25) 1982; 11
10.1016/j.dam.2007.03.023_bib40
Erickson (10.1016/j.dam.2007.03.023_bib16) 1999; 1999
10.1016/j.dam.2007.03.023_bib42
10.1016/j.dam.2007.03.023_bib29
Prasad (10.1016/j.dam.2007.03.023_bib35) 1990; 19
Huang (10.1016/j.dam.2007.03.023_bib23) 1998; 14
Bax (10.1016/j.dam.2007.03.023_bib4) 1993; 47
Bax (10.1016/j.dam.2007.03.023_bib6) 1996; 60
10.1016/j.dam.2007.03.023_bib27
Tarjan (10.1016/j.dam.2007.03.023_bib41) 1977; 6
Karp (10.1016/j.dam.2007.03.023_bib28) 1982; 1
Moon (10.1016/j.dam.2007.03.023_bib33) 1971; 17
Downey (10.1016/j.dam.2007.03.023_bib12) 1995; 141
Held (10.1016/j.dam.2007.03.023_bib21) 1962; 10
Schwikowski (10.1016/j.dam.2007.03.023_bib38) 2002; 117
Lipton (10.1016/j.dam.2007.03.023_bib32) 1980; 9
Nešetřil (10.1016/j.dam.2007.03.023_bib34) 1985; 26
Fedin (10.1016/j.dam.2007.03.023_bib18) 2002; 293
Schroeppel (10.1016/j.dam.2007.03.023_bib37) 1981; 10
Banzhaf III (10.1016/j.dam.2007.03.023_bib3) 1965; 19
Bax (10.1016/j.dam.2007.03.023_bib5) 1994; 52
10.1016/j.dam.2007.03.023_bib19
Horowitz (10.1016/j.dam.2007.03.023_bib22) 1974; 21
Itai (10.1016/j.dam.2007.03.023_bib26) 1978; 7
10.1016/j.dam.2007.03.023_bib14
10.1016/j.dam.2007.03.023_bib15
Dobkin (10.1016/j.dam.2007.03.023_bib11) 1978; 16
10.1016/j.dam.2007.03.023_bib17
10.1016/j.dam.2007.03.023_bib39
Afrati (10.1016/j.dam.2007.03.023_bib1) 1986; 20
Lawler (10.1016/j.dam.2007.03.023_bib30) 1976; 5
Coppersmith (10.1016/j.dam.2007.03.023_bib10) 1990; 9
Robson (10.1016/j.dam.2007.03.023_bib36) 1986; 7
Alon (10.1016/j.dam.2007.03.023_bib2) 1995; 42
References_xml – reference: M. Ben-Or, Lower bounds for algebraic computation trees. in: Proceedings of the 15th Annual ACM Symposium on the Theory of Computing (STOC’1983), 1983, pp. 80–86.
– reference: D. Eppstein, The traveling salesman problem for cubic graphs, in: Proceedings of the 8th International Workshop on Algorithms and Data Structures (WADS’2003), Lecture Notes in Computer Science, vol. 2748, 2003, pp. 307–318.
– reference: R. Beigel, Finding maximum independent sets in sparse and general graphs, in: Proceedings of the 10th ACM–SIAM Symposium on Discrete Algorithms (SODA’1999), 1999, pp. 856–857.
– volume: 11
  start-page: 676
  year: 1982
  end-page: 686
  ident: bib25
  article-title: Hamiltonian paths in grid graphs
  publication-title: SIAM J. Comput.
– volume: 47
  start-page: 203
  year: 1993
  end-page: 207
  ident: bib4
  article-title: Inclusion and exclusion algorithm for the Hamiltonian path problem
  publication-title: Inform. Process. Lett.
– volume: 17
  start-page: 345
  year: 1971
  end-page: 349
  ident: bib33
  article-title: On maximal transitive subtournaments
  publication-title: Proc. Edinburgh Math. Soc.
– volume: 26
  start-page: 415
  year: 1985
  end-page: 419
  ident: bib34
  article-title: On the complexity of the subgraph problem
  publication-title: Comment. Math. Univ. Carolin.
– volume: 21
  start-page: 277
  year: 1974
  end-page: 292
  ident: bib22
  article-title: Computing partitions with applications to the knapsack problem
  publication-title: J. ACM
– volume: 7
  start-page: 425
  year: 1986
  end-page: 440
  ident: bib36
  article-title: Algorithms for maximum independent sets
  publication-title: J. Algorithms
– volume: 5
  start-page: 66
  year: 1976
  end-page: 67
  ident: bib30
  article-title: A note on the complexity of the chromatic number problem
  publication-title: Inform. Process. Lett.
– volume: 13
  start-page: 42
  year: 1997
  end-page: 49
  ident: bib9
  article-title: Rectangular matrix multiplication revisited
  publication-title: J. Complexity
– reference: U. Feige, J. Kilian, On limited versus polynomial nondeterminism, Chicago J. Theoret. Comput. Sci., 1997.
– volume: 42
  start-page: 844
  year: 1995
  end-page: 856
  ident: bib2
  article-title: Color-coding
  publication-title: J. ACM
– volume: 10
  start-page: 456
  year: 1981
  end-page: 464
  ident: bib37
  article-title: A
  publication-title: SIAM J. Comput.
– volume: 20
  start-page: 79
  year: 1986
  end-page: 87
  ident: bib1
  article-title: The complexity of the travelling repairman problem
  publication-title: RAIRO Inform. Théor. Appl.
– volume: 9
  start-page: 615
  year: 1980
  end-page: 627
  ident: bib32
  article-title: Applications of a planar separator theorem
  publication-title: SIAM J. Comput.
– volume: 1999
  year: 1999
  ident: bib16
  article-title: Lower bounds for linear satisfiability problems
  publication-title: Chicago J. Theoret. Comput. Sci.
– volume: 36
  start-page: 177
  year: 1979
  end-page: 189
  ident: bib31
  article-title: A separator theorem for planar graphs
  publication-title: SIAM J. Appl. Math.
– volume: 16
  start-page: 413
  year: 1978
  end-page: 417
  ident: bib11
  article-title: A lower bound of
  publication-title: J. Comput. System Sci.
– reference: E. Speckenmeyer, On feedback problems in digraphs, in: Proceedings of the 15th Workshop on Graph-Theoretic Concepts in Computer Science (WG’1989), Lecture Notes in Computer Science, vol. 411, Springer, Berlin, 1989, pp. 218–231.
– volume: 19
  start-page: 317
  year: 1965
  end-page: 343
  ident: bib3
  article-title: Weighted voting doesn’t work: a mathematical analysis
  publication-title: Rutgers Law Rev.
– reference: V. Kann, On the approximability of NP-complete optimization problems, Ph.D. Thesis, Kungliga Tekniska Högskolan, Stockholm, 1992.
– volume: 141
  start-page: 109
  year: 1995
  end-page: 131
  ident: bib12
  article-title: Fixed-parameter tractability and completeness II: on completeness for W[1]
  publication-title: Theoret. Comput. Sci.
– volume: 52
  start-page: 249
  year: 1994
  end-page: 252
  ident: bib5
  article-title: Algorithms to count paths and cycles
  publication-title: Inform. Process. Lett.
– volume: 117
  start-page: 253
  year: 2002
  end-page: 265
  ident: bib38
  article-title: On enumerating all minimal solutions of feedback problems
  publication-title: Discrete Appl. Math.
– reference: G.J. Woeginger, Exact algorithms for NP-hard problems: a survey, in: Combinatorial Optimization—Eureka, you shrink!”, Lecture Notes in Computer Science, vol. 2570, Springer, Berlin, 2003, pp. 185–207.
– reference: B. Klinz, G.J. Woeginger, Faster algorithms for computing power indices in weighted majority games, Math. Social Sci., 2004.
– volume: 6
  start-page: 537
  year: 1977
  end-page: 546
  ident: bib41
  article-title: Finding a maximum independent set
  publication-title: SIAM J. Comput.
– volume: 293
  start-page: 129
  year: 2002
  end-page: 138
  ident: bib18
  article-title: Solution of the maximum cut problem in time
  publication-title: Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov.
– volume: 9
  start-page: 398
  year: 1993
  end-page: 423
  ident: bib24
  article-title: The searching over separators strategy to solve some NP-hard problems in subexponential time
  publication-title: Algorithmica
– volume: 1
  start-page: 49
  year: 1982
  end-page: 51
  ident: bib28
  article-title: Dynamic programming meets the principle of inclusion and exclusion
  publication-title: Oper. Res. Lett.
– volume: 10
  start-page: 196
  year: 1962
  end-page: 210
  ident: bib21
  article-title: A dynamic programming approach to sequencing problems
  publication-title: J. SIAM
– reference: J. Erickson, Private communication, 2004.
– reference: W.D. Smith, Studies in computational geometry motivated by mesh generation. Ph.D. Thesis, Princeton University, Princeton.
– reference: R. Williams, A new algorithm for optimal constraint satisfaction and its implications, in: Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP’2004), Springer, Berlin, 2004.
– volume: 5
  start-page: 165
  year: 1995
  end-page: 185
  ident: bib20
  article-title: On a class of
  publication-title: Comput. Geom.
– year: 1999
  ident: bib13
  article-title: Parameterized complexity, Springer Monographs in Computer Science
– volume: 14
  start-page: 257
  year: 1998
  end-page: 299
  ident: bib23
  article-title: Fast rectangular matrix multiplication and applications
  publication-title: J. Complexity
– volume: 9
  start-page: 251
  year: 1990
  end-page: 280
  ident: bib10
  article-title: Matrix multiplication via arithmetic progressions
  publication-title: J. Symbolic Comput.
– volume: 7
  start-page: 413
  year: 1978
  end-page: 423
  ident: bib26
  article-title: Finding a minimum circuit in a graph
  publication-title: SIAM J. Comput.
– volume: 19
  start-page: 1
  year: 1990
  end-page: 9
  ident: bib35
  article-title: NP-completeness of some problems concerning voting games
  publication-title: Internat. J. Game Theory
– reference: F. Eisenbrand, F. Grandoni, On the complexity of fixed parameter clique and dominating set. Theoret. Comput. Sci., 2004.
– volume: 60
  start-page: 171
  year: 1996
  end-page: 176
  ident: bib6
  article-title: A finite-difference sieve to count paths and cycles by length
  publication-title: Inform. Process. Lett.
– ident: 10.1016/j.dam.2007.03.023_bib15
– volume: 19
  start-page: 1
  year: 1990
  ident: 10.1016/j.dam.2007.03.023_bib35
  article-title: NP-completeness of some problems concerning voting games
  publication-title: Internat. J. Game Theory
  doi: 10.1007/BF01753703
– volume: 9
  start-page: 615
  year: 1980
  ident: 10.1016/j.dam.2007.03.023_bib32
  article-title: Applications of a planar separator theorem
  publication-title: SIAM J. Comput.
  doi: 10.1137/0209046
– volume: 17
  start-page: 345
  year: 1971
  ident: 10.1016/j.dam.2007.03.023_bib33
  article-title: On maximal transitive subtournaments
  publication-title: Proc. Edinburgh Math. Soc.
  doi: 10.1017/S0013091500009639
– volume: 47
  start-page: 203
  year: 1993
  ident: 10.1016/j.dam.2007.03.023_bib4
  article-title: Inclusion and exclusion algorithm for the Hamiltonian path problem
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(93)90033-6
– ident: 10.1016/j.dam.2007.03.023_bib19
– ident: 10.1016/j.dam.2007.03.023_bib17
– ident: 10.1016/j.dam.2007.03.023_bib42
  doi: 10.1007/978-3-540-27836-8_101
– volume: 14
  start-page: 257
  year: 1998
  ident: 10.1016/j.dam.2007.03.023_bib23
  article-title: Fast rectangular matrix multiplication and applications
  publication-title: J. Complexity
  doi: 10.1006/jcom.1998.0476
– volume: 5
  start-page: 66
  year: 1976
  ident: 10.1016/j.dam.2007.03.023_bib30
  article-title: A note on the complexity of the chromatic number problem
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(76)90065-X
– volume: 19
  start-page: 317
  year: 1965
  ident: 10.1016/j.dam.2007.03.023_bib3
  article-title: Weighted voting doesn’t work: a mathematical analysis
  publication-title: Rutgers Law Rev.
– ident: 10.1016/j.dam.2007.03.023_bib27
– ident: 10.1016/j.dam.2007.03.023_bib29
  doi: 10.1016/j.mathsocsci.2004.06.002
– volume: 5
  start-page: 165
  year: 1995
  ident: 10.1016/j.dam.2007.03.023_bib20
  article-title: On a class of O(n2) problems in computational geometry
  publication-title: Comput. Geom.
  doi: 10.1016/0925-7721(95)00022-2
– volume: 7
  start-page: 413
  year: 1978
  ident: 10.1016/j.dam.2007.03.023_bib26
  article-title: Finding a minimum circuit in a graph
  publication-title: SIAM J. Comput.
  doi: 10.1137/0207033
– volume: 60
  start-page: 171
  year: 1996
  ident: 10.1016/j.dam.2007.03.023_bib6
  article-title: A finite-difference sieve to count paths and cycles by length
  publication-title: Inform. Process. Lett.
  doi: 10.1016/S0020-0190(96)00159-7
– year: 1999
  ident: 10.1016/j.dam.2007.03.023_bib13
  doi: 10.1007/978-1-4612-0515-9
– ident: 10.1016/j.dam.2007.03.023_bib43
  doi: 10.1007/3-540-36478-1_17
– volume: 42
  start-page: 844
  year: 1995
  ident: 10.1016/j.dam.2007.03.023_bib2
  article-title: Color-coding
  publication-title: J. ACM
  doi: 10.1145/210332.210337
– volume: 52
  start-page: 249
  year: 1994
  ident: 10.1016/j.dam.2007.03.023_bib5
  article-title: Algorithms to count paths and cycles
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(94)00151-0
– volume: 10
  start-page: 196
  year: 1962
  ident: 10.1016/j.dam.2007.03.023_bib21
  article-title: A dynamic programming approach to sequencing problems
  publication-title: J. SIAM
– volume: 13
  start-page: 42
  year: 1997
  ident: 10.1016/j.dam.2007.03.023_bib9
  article-title: Rectangular matrix multiplication revisited
  publication-title: J. Complexity
  doi: 10.1006/jcom.1997.0438
– volume: 293
  start-page: 129
  year: 2002
  ident: 10.1016/j.dam.2007.03.023_bib18
  article-title: Solution of the maximum cut problem in time 2|E|/4
  publication-title: Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov.
– ident: 10.1016/j.dam.2007.03.023_bib40
  doi: 10.1007/3-540-52292-1_16
– ident: 10.1016/j.dam.2007.03.023_bib39
– volume: 9
  start-page: 398
  year: 1993
  ident: 10.1016/j.dam.2007.03.023_bib24
  article-title: The searching over separators strategy to solve some NP-hard problems in subexponential time
  publication-title: Algorithmica
  doi: 10.1007/BF01228511
– volume: 117
  start-page: 253
  year: 2002
  ident: 10.1016/j.dam.2007.03.023_bib38
  article-title: On enumerating all minimal solutions of feedback problems
  publication-title: Discrete Appl. Math.
  doi: 10.1016/S0166-218X(00)00339-5
– volume: 6
  start-page: 537
  year: 1977
  ident: 10.1016/j.dam.2007.03.023_bib41
  article-title: Finding a maximum independent set
  publication-title: SIAM J. Comput.
  doi: 10.1137/0206038
– ident: 10.1016/j.dam.2007.03.023_bib14
  doi: 10.1016/j.tcs.2004.05.009
– volume: 20
  start-page: 79
  year: 1986
  ident: 10.1016/j.dam.2007.03.023_bib1
  article-title: The complexity of the travelling repairman problem
  publication-title: RAIRO Inform. Théor. Appl.
  doi: 10.1051/ita/1986200100791
– volume: 11
  start-page: 676
  year: 1982
  ident: 10.1016/j.dam.2007.03.023_bib25
  article-title: Hamiltonian paths in grid graphs
  publication-title: SIAM J. Comput.
  doi: 10.1137/0211056
– volume: 21
  start-page: 277
  year: 1974
  ident: 10.1016/j.dam.2007.03.023_bib22
  article-title: Computing partitions with applications to the knapsack problem
  publication-title: J. ACM
  doi: 10.1145/321812.321823
– volume: 1
  start-page: 49
  year: 1982
  ident: 10.1016/j.dam.2007.03.023_bib28
  article-title: Dynamic programming meets the principle of inclusion and exclusion
  publication-title: Oper. Res. Lett.
  doi: 10.1016/0167-6377(82)90044-X
– ident: 10.1016/j.dam.2007.03.023_bib7
– volume: 141
  start-page: 109
  year: 1995
  ident: 10.1016/j.dam.2007.03.023_bib12
  article-title: Fixed-parameter tractability and completeness II: on completeness for W[1]
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/0304-3975(94)00097-3
– volume: 1999
  issue: 8
  year: 1999
  ident: 10.1016/j.dam.2007.03.023_bib16
  article-title: Lower bounds for linear satisfiability problems
  publication-title: Chicago J. Theoret. Comput. Sci.
– volume: 9
  start-page: 251
  year: 1990
  ident: 10.1016/j.dam.2007.03.023_bib10
  article-title: Matrix multiplication via arithmetic progressions
  publication-title: J. Symbolic Comput.
  doi: 10.1016/S0747-7171(08)80013-2
– volume: 16
  start-page: 413
  year: 1978
  ident: 10.1016/j.dam.2007.03.023_bib11
  article-title: A lower bound of 12n2 on linear search programs for the knapsack problem
  publication-title: J. Comput. System Sci.
  doi: 10.1016/0022-0000(78)90026-0
– volume: 10
  start-page: 456
  year: 1981
  ident: 10.1016/j.dam.2007.03.023_bib37
  article-title: A T=O(2n/2), S=O(2n/4) algorithm for certain NP-complete problems
  publication-title: SIAM J. Comput.
  doi: 10.1137/0210033
– volume: 36
  start-page: 177
  year: 1979
  ident: 10.1016/j.dam.2007.03.023_bib31
  article-title: A separator theorem for planar graphs
  publication-title: SIAM J. Appl. Math.
  doi: 10.1137/0136016
– ident: 10.1016/j.dam.2007.03.023_bib8
  doi: 10.1145/800061.808735
– volume: 7
  start-page: 425
  year: 1986
  ident: 10.1016/j.dam.2007.03.023_bib36
  article-title: Algorithms for maximum independent sets
  publication-title: J. Algorithms
  doi: 10.1016/0196-6774(86)90032-5
– volume: 26
  start-page: 415
  year: 1985
  ident: 10.1016/j.dam.2007.03.023_bib34
  article-title: On the complexity of the subgraph problem
  publication-title: Comment. Math. Univ. Carolin.
SSID ssj0001218
ssj0000186
ssj0006644
Score 2.1377752
Snippet We list a number of open questions around worst case time bounds and worst case space bounds for NP-hard problems. We are interested in exponential time...
SourceID pascalfrancis
crossref
elsevier
SourceType Index Database
Enrichment Source
Publisher
StartPage 397
SubjectTerms Algorithmics. Computability. Computer arithmetics
Applied sciences
Combinatorial optimization
Combinatorics
Combinatorics. Ordered structures
Computational complexity
Computer science; control theory; systems
Exact sciences and technology
Mathematics
Sciences and techniques of general use
Theoretical computing
Title Open problems around exact algorithms
URI https://dx.doi.org/10.1016/j.dam.2007.03.023
Volume 156
WOSCitedRecordID wos000253370100009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-6771
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001218
  issn: 0166-218X
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELag5VCEBJQiyqPKAS6sgpzYsb1HBEsBidJDEXuL4hds1U1XyYL25zOO7SRtoYgDl2hlJdnE32RmPJ6ZD6HnhhUZJ1KA8CqbUp5XKUgJTrWQHSNcYWjVkU3woyMxn0-PA_Ff29EJ8LoWm8109V-hhjEA25XO_gPc_U1hAH4D6HAE2OF4Ffjf2p-3C9AF4AxPquBiLvverO1YRFwyySQwyrSTqnEMSxOzcVWT1dm382ax_r7sXe6vn2eHfeLEoWlctVbYU4pBAxHzjGMkK5jdcWCRsRTM_dzbBa8MBc9Txj1FSq8tfR_wIBZkpPuIT7QNZpR21dRXNbQPFpzCoy1DA0nyCvuS44vdsC9ZqT53MHdLVCamN9F2TpiABff26w-z-cdR0zDXEW8nhtmGXSXwrmjo9e7fNe5yd_l-lx7oT37KnVXVwtdjPe3JyBc5uYf2hirN5LjH_z66YepddDcsK5KgtNtddPvTAP8D9MKhnkTUE4960qGeDKjvoS_vZidv3qeBKyNVhON1yqZaZtpmhSCcUgXrRPBlZYGpscJmjiRBKSU10znWeaWlIlhacH9zy2FE5uQh2qrPa_MIJVTnWjALd7KCWiJkRg2ulODS8CKzxT7CcWZKFRrJOz6TszJmDJ6WMJmO4JSXmJQwmfvoZX_JyndRue5kGqe7DG6gd-9KkKHrLju4AE3_R1FgHv_thCdoZ_hWnqKtdfPDPEO31M_1om0Ogpj9AhQUfuw
linkProvider Elsevier
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%3Ajournal&rft.genre=proceeding&rft.title=Discrete+applied+mathematics&rft.atitle=Open+problems+around+exact+algorithms&rft.au=WOEGINGER%2C+Gerhard+J&rft.date=2008-02-01&rft.pub=Elsevier&rft.issn=0166-218X&rft.eissn=1872-6771&rft.volume=156&rft.issue=3&rft.spage=397&rft.epage=405&rft_id=info:doi/10.1016%2Fj.dam.2007.03.023&rft.externalDBID=n%2Fa&rft.externalDocID=20222689
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0166-218X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0166-218X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0166-218X&client=summon