{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T14:58:56Z","timestamp":1764687536312},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001423"},{"type":"electronic","value":"9783540361367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36136-7_23","type":"book-chapter","created":{"date-parts":[[2008,11,25]],"date-time":"2008-11-25T14:07:11Z","timestamp":1227622031000},"page":"249-261","source":"Crossref","is-referenced-by-count":5,"title":["An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover"],"prefix":"10.1007","author":[{"given":"Ulrike","family":"Stege","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iris","family":"van Rooij","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Hertel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Hertel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0012-365X(00)00199-0","volume":"229","author":"J. Alber","year":"2001","unstructured":"J. Alber, J. Gramm, R. Niedermeier, \u201cFaster exact algorithms for hard problems: A parameterized point of view,\u201d Discr. Mathematics (2001) 229, 3\u201327.","journal-title":"Discr. Mathematics"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0020-0190(97)00213-5","volume":"65","author":"R. Balasubramanian","year":"1998","unstructured":"R. Balasubramanian, M.R. Fellows, and V. Raman, \u201cAn improved fixed-parameter algorithm for Vertex Cover\u201d. Inform. Proc. Letters (1998) 65, 163\u2013168.","journal-title":"Inform. Proc. Letters"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.2001.1186","volume":"41","author":"J. Chen","year":"2001","unstructured":"J. Chen, I.A. Kanj, W. Jia, \u201cVertex Cover: Further observations and further improvements,\u201d J. Algorithms (2001), 41, 280\u2013301.","journal-title":"J. Algorithms"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"R.G. Downey and M.R. Fellows, Parameterized Complexity (1999), Springer.","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"23_CR5","first-page":"49","volume":"49","author":"R.G. Downey","year":"1999","unstructured":"R.G. Downey, M.R. Fellows, and U. Stege, \u201cParameterized Complexity: A Framework for Systematically Confronting Computational Intractability,\u201d AMS-DIMACS Proc. Series (1999) 49, 49\u201399.","journal-title":"AMS-DIMACS Proc. Series"},{"key":"23_CR6","unstructured":"R.G. Downey, M.R. Fellows, and U. Stege, \u201cComputational Tractability: The View From Mars,\u201d Bulletin of the EATCS (1999)."},{"key":"23_CR7","unstructured":"M.R. Fellows, \u201cOn the complexity of vertex set problems,\u201d Tech. Rep. (1988), Computer Science Department, University of New Mexico."},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"M.R. Fellows, \u201cParameterized Complexity: The Main Ideas and Connections To Practical Computing,\u201d 1st Dagstuhl Workshop on Exp. Algorithms (2001).","DOI":"10.1007\/3-540-36383-1_3"},{"key":"23_CR9","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman."},{"key":"23_CR10","unstructured":"R.L. Graham, D.E. Knuth, and O. Patashnik, Concrete Mathematics, Addison-Wesley (1994)."},{"key":"23_CR11","unstructured":"J. Gross and J. Yellen, Graph theory and its applications (1999), CRC Press."},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1146\/annurev.psych.52.1.653","volume":"52","author":"R. Hastie","year":"2001","unstructured":"R. Hastie, \u201cProblems for judgment and decision making,\u201d Ann. Review of Psychology (2001) 52, 653\u2013683.","journal-title":"Ann. Review of Psychology"},{"volume-title":"Rationality: Psychological and philosophical perspectives","year":"1993","key":"23_CR13","unstructured":"K.I. Manktelow and D.E. Over (Eds.), Rationality: Psychological and philosophical perspectives (1993), London, Routledge."},{"key":"23_CR14","unstructured":"P.K. Moser (Ed.), Rationality in action: Contemporary approaches (1990), Cambridge University Press."},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G.L. Nemhauser","year":"1975","unstructured":"G.L. Nemhauser and L.E. Trotter, \u201cVertex packing: structural properties and algorithms,\u201d Mathematical Programming (1975), 8, 232\u2013248.","journal-title":"Mathematical Programming"},{"key":"23_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/3-540-49116-3_53","volume-title":"Proc. of 16th STACS","author":"R. Niedermeier","year":"1999","unstructured":"R. Niedermeier and P. Rossmanith, \u201cUpper Bounds for Vertex Cover Further Improved,\u201d In Proc. of 16th STACS (1999). LNCS 1563, 561\u2013570."},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0020-0190(00)00004-1","volume":"73","author":"R. Niedermeier","year":"2000","unstructured":"R. Niedermeier, P. Rossmanith, \u201cA general method to speed up fixed-parameter-tractable algorithms,\u201d Inf. Proc. Letters (2000) 73, 125\u2013129.","journal-title":"Inf. Proc. Letters"},{"key":"23_CR18","unstructured":"M. Oaksford and N. Chater, \u201cReasoning theories and bounded rationality,\u201d In K.I. Manktelow & D.E. Over (Eds.) Rationality: Psychological and philosophical perspectives (1993), 31\u201360, Routledge."},{"key":"23_CR19","unstructured":"J. Setubal and J. Meidanis. Introduction to Computational Molecular Biology (1997), PWS Publ. Comp."},{"issue":"1","key":"23_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1146\/annurev.ps.41.020190.000245","volume":"41","author":"H.A. Simon","year":"1990","unstructured":"H.A. Simon, \u201cInvariants of human behavior\u201d. Ann. Rev. Psych. (1990) 41(1), 1\u201319.","journal-title":"Ann. Rev. Psych."},{"key":"23_CR21","unstructured":"U. Stege, Resolving Conflicts from Problems in Computational Biology (2000) Ph.D. thesis, No.13364, ETH Z\u00fcrich."},{"key":"23_CR22","volume-title":"Tech. Rep. 318","author":"U. Stege","year":"1999","unstructured":"U. Stege and M.R. Fellows, \u201cAn Improved Fixed-Parameter-Tractable Algorithm for Vertex Cover,\u201d (1999) Tech. Rep. 318, Dept. of Comp. Science, ETH Z\u00fcrich."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36136-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:28:53Z","timestamp":1557930533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36136-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001423","9783540361367"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-36136-7_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}