Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Greedy algorithm")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 2001

  • Page / 81
Export

Selection :

  • and

On the geometric structure of independence systemsCONFORTI, M; LAURENT, M.Mathematical programming. 1989, Vol 45, Num 2, pp 255-277, issn 0025-5610, 23 p.Article

Characterizations of polygreedoids and poly-antimatroids by greedy algorithmsNAKAMURA, Masataka.Operations research letters. 2005, Vol 33, Num 4, pp 389-394, issn 0167-6377, 6 p.Article

The Weak Chebyshev X-Greedy Algorithm in the unweighted Bergman spaceDILWORTH, S. J; KUTZAROVA, Denka; SHUMAN, Karen L et al.Journal of mathematical analysis and applications. 2006, Vol 318, Num 2, pp 692-706, issn 0022-247X, 15 p.Article

On structures of bisubmodular polyhedraANDO, K; FUJISHIGE, S.Mathematical programming. 1996, Vol 74, Num 3, pp 293-317, issn 0025-5610Article

A better-than-greedy approximation algorithm for the minimum set cover problemHASSIN, Refael; LEVIN, Asaf.SIAM journal on computing (Print). 2006, Vol 35, Num 1, pp 189-200, issn 0097-5397, 12 p.Article

A note on 'Algorithms for connected set cover problem and fault-tolerant connected set cover problemWEI REN; QING ZHAO.Theoretical computer science. 2011, Vol 412, Num 45, pp 6451-6454, issn 0304-3975, 4 p.Article

On the growth of the counting function of Stanley sequencesMOY, Richard A.Discrete mathematics. 2011, Vol 311, Num 7, pp 560-562, issn 0012-365X, 3 p.Article

Greedy T-colorings of graphsJANCZEWSKI, Robert.Discrete mathematics. 2009, Vol 309, Num 6, pp 1685-1690, issn 0012-365X, 6 p.Article

A polynomial-time algorithm for the change-making problemPEARSON, David.Operations research letters. 2005, Vol 33, Num 3, pp 231-234, issn 0167-6377, 4 p.Article

The discrepancy of the lex-least de Bruijn sequenceCOOPER, Joshua; HEITSCHB, Christine.Discrete mathematics. 2010, Vol 310, Num 6-7, pp 1152-1159, issn 0012-365X, 8 p.Article

Constrained partitioning problemsBURKARD, R. E; EN-YU YAO.Discrete applied mathematics. 1990, Vol 28, Num 1, pp 21-34, issn 0166-218X, 14 p.Article

Hierarchies for classes of priority algorithms for Job SchedulingPAPAKONSTANTINOU, Periklis A.Theoretical computer science. 2006, Vol 352, Num 1-3, pp 181-189, issn 0304-3975, 9 p.Article

The sequential sum problem and performance bounds on the greedy algorithm for the on-line steiner problemMILLER, Zevi; PRITIKIN, Dan; PERKEL, Manley et al.Networks (New York, NY). 2005, Vol 45, Num 3, pp 143-164, issn 0028-3045, 22 p.Article

The average behaviour of greedy algorithms for the knapsack problem: General distributionsDIUBIN, Gennady; KORBUT, Alexander.Mathematical methods of operations research (Heidelberg). 2003, Vol 57, Num 3, pp 449-479, issn 1432-2994, 31 p.Article

Dynamic and distributed early planning assessment by a hybrid simulated annealing and greedy algorithmMAROPOULOS, P. G; MCKAY, K; BRAMALL, D. G et al.Proceedings of the Institution of Mechanical Engineers. Part B. Journal of engineering manufacture. 2003, Vol 217, Num 10, pp 1429-1442, issn 0954-4054, 14 p.Article

Learning Capability of Relaxed Greedy AlgorithmsSHAOBO LIN; YUANHUA RONG; XINGPING SUN et al.IEEE transactions on neural networks and learning systems (Print). 2013, Vol 24, Num 10, pp 1598-1608, issn 2162-237X, 11 p.Article

A greedy, graph-based algorithm for the alignment of multiple homologous gene listsFOSTIER, Jan; PROOST, Sebastian; DHOEDT, Bart et al.Bioinformatics (Oxford. Print). 2011, Vol 27, Num 6, pp 749-756, issn 1367-4803, 8 p.Article

Robustness of Greedy Type Minimum Evolution AlgorithmsSHIGEZUMI, Takeya.Lecture notes in computer science. 2006, pp 815-821, issn 0302-9743, isbn 3-540-34379-2, 7 p.Conference Paper

On the approximability of the minimum test collection problemHALLDORSSON, Bjarni V; HALLDORSSON, Magnus M; RAVI, R et al.Lecture notes in computer science. 2001, pp 158-169, issn 0302-9743, isbn 3-540-42493-8Conference Paper

On the sequentiality of the successor functionFROUGNY, C.Information and computation (Print). 1997, Vol 139, Num 1, pp 17-38, issn 0890-5401Article

Small transversals in hypergraphsCHVATAL, V; MCDIARMID, C.Combinatorica (Print). 1992, Vol 12, Num 1, pp 19-26, issn 0209-9683Article

On incremental computation of transitive closure and greedy alignmentABDEDDAÏM, S.Lecture notes in computer science. 1997, pp 167-179, issn 0302-9743, isbn 3-540-63220-4Conference Paper

Δ-Matroids with the strong exchange conditionsWENZEL, W.Applied mathematics letters. 1993, Vol 6, Num 5, pp 67-70, issn 0893-9659Article

Quasi-greedy triangulations approximating the minimum weight triangulationLEVCOPOULOS, C; KRZNARIC, D.Journal of algorithms (Print). 1998, Vol 27, Num 2, pp 303-338, issn 0196-6774Conference Paper

Matchings and Δ-matroids with coefficientsKALHOFF, F; WENZEL, W.Advances in applied mathematics (Print). 1996, Vol 17, Num 1, pp 63-87, issn 0196-8858Article

  • Page / 81