Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with Search options user 476

Questions about problems that entail selecting the best element from some set of available alternatives, and methods to solve them.

5
votes
The problem can be formulated as a LP problem: Given a set of $n$ numbers $[a_1,a_2... a_n]$, solve the following LP: $$ \min \sum |a_i - x| $$ (Removed constraints on $x$, which weren't necessary …
answered May 6 '14 by TCSGrad
1
vote
As the tag suggests, this is a classic greedy algorithm. Some notations: $ancestor(i, c)$ denotes the ancestor on the $i$-th level (root $R$ is at level 0) $delay(c)$ denotes the propagation delay f …
answered May 7 '14 by TCSGrad