Maximum coverage problem: Revision history

Article
Talk

View logs for this page (view filter log)

Filter revisionsshowhide

To date:

Tag filter:

Invert selection

External tools:

For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

curprev 20:2120:21, 9 July 2015 J. Finkelstein talk contribs m 9,183 bytes −84 no need to duplicate reference undo
curprev 20:2020:20, 9 July 2015 J. Finkelstein talk contribs m 9,267 bytes +13 →Greedy algorithm: cleans citation undo
curprev 18:5118:51, 9 July 2015 J. Finkelstein talk contribs 9,254 bytes +85 →ILP formulation: arranges maximization problem constraints in a table for readability undo
curprev 18:4118:41, 9 July 2015 J. Finkelstein talk contribs m 9,169 bytes +237 →References: separates inline references from general references undo

curprev 07:1307:13, 8 June 2015 David Eppstein talk contribs m 8,932 bytes +92 →Greedy algorithm: templatize ref undo

curprev 18:1618:16, 6 March 2015 LilHelpa talk contribs m 8,840 bytes +2 its→it is undo

curprev 18:2718:27, 12 February 2014 Semihatakan talk contribs m 8,838 bytes +26 Operations research people like this problem too (see the 1st reference), added that to the intro. undo

curprev 13:5113:51, 7 February 2014 141.2.115.82 talk 8,812 bytes −3 →ILP formulation undo

curprev 14:2714:27, 17 October 2012 Baldazen talk contribs m 8,815 bytes +1 →Known extensions: corrected typo undo
curprev 14:2614:26, 17 October 2012 Baldazen talk contribs m 8,814 bytes +23 →Known extensions: Corrected some typos. undo

curprev 02:3202:32, 15 October 2012 Piyush Sriva talk contribs m 8,791 bytes −31 Removed orphan tag (Submodular set function links here) undo
curprev 02:3102:31, 15 October 2012 Piyush Sriva talk contribs 8,822 bytes −15 approximation factors for maximization problems are usually written so as to be less than 1 undo
curprev 02:2402:24, 15 October 2012 Piyush Sriva talk contribs 8,837 bytes +331 approximation factors for maximization problems are usually written so as to be less than 1 undo

curprev 09:1909:19, 4 July 2012 2620:0:10c8:1001:a800:ff:fe3a:f94b talk 8,506 bytes −77 rm incorrect definition undo

curprev 22:5722:57, 1 September 2011 142.244.143.14 talk 8,583 bytes +1 →Related problems undo
curprev 22:5622:56, 1 September 2011 142.244.143.14 talk 8,582 bytes −2 →Related problems undo

curprev 18:5518:55, 1 August 2011 128.122.253.228 talk 8,584 bytes 0 →Generalized maximum coverage undo

curprev 02:4302:43, 7 June 2011 75.46.88.173 talk 8,584 bytes −4 →Budgeted maximum coverage undo

curprev 09:2509:25, 4 August 2010 77.250.168.7 talk 8,588 bytes +2 No edit summary undo

curprev 05:1205:12, 15 May 2010 98.219.162.83 talk 8,586 bytes +1 →Greedy algorithm undo
curprev 04:5804:58, 15 May 2010 98.219.162.83 talk 8,585 bytes +253 →Greedy algorithm undo

curprev 04:4704:47, 13 February 2010 RobinK talk contribs 8,332 bytes +42 Fixing links to disambiguation pages, added orphan tag using AWB undo

curprev 09:3309:33, 2 February 2010 146.48.82.89 talk 8,290 bytes −8 →Weighted version undo

curprev 08:2508:25, 3 November 2009 SmackBot talk contribs m 8,221 bytes +80 →Greedy algorithm: Date maintenance tags and general fixes undo

curprev 04:2904:29, 6 September 2009 Michael Hardy talk contribs 8,029 bytes −2 fixed headings per WP:MOS undo

curprev 14:2414:24, 5 September 2009 LiranKatzir talk contribs m 8,031 bytes +2 →References undo
curprev 14:0514:05, 5 September 2009 94.159.221.114 talk 8,029 bytes −1 →References undo

Retrieved from "https://en.wikipedia.org/wiki/Maximum_coverage_problem"