Network profile

AmeerJ

Reputation

587

2017
2018
2019
2020

Top tag

graph-theory

Next privilege

1,000 Rep.

See votes

Badges

Newest

Yearling

Next badge

0/1

Impact

1 post edited

0 helpful flags

16 votes cast

11 Questions

Votes Activity Newest Views

votes

answers

views

Sorting using a black box

Mar 26 '13 at 7:18 AmeerJ 587

votes

answer

views

Minimum shortest path cover of $n$ vertices in $R^m$

graph-theory cg.comp-geom

May 20 '13 at 16:49 AmeerJ 587

votes

answers

205

views

Fast high-dimensional K-nearest neighbors

cg.comp-geom time-complexity computational-geometry

Nov 16 '14 at 15:40 Community♦ 1

-1

votes

answer

205

views

Weighted nonoverlapping intervals

interval-graphs

Jun 20 '17 at 19:47 AmeerJ 587

votes

answers

159

views

Optimal set union tree

optimization tree binary-trees set-system

Oct 14 '18 at 15:57 AmeerJ 587

votes

answers

156

views

Minimum cut on a directed graph with negative term

graph-theory max-flow-min-cut

Dec 10 '17 at 20:48 AmeerJ 587

votes

answers

147

views

Maximum weight non-overlapping paths in a DAG

graph-theory max-flow-min-cut

Dec 10 '17 at 22:00 AmeerJ 587

votes

answer

109

views

Complexity of maximising weighted sum of and functions on a set of binary variables

cc.complexity-theory circuit-complexity

Jan 7 '18 at 19:04 AmeerJ 587

votes

answer

views

Are equally weighted MSTs closely related?

graph-theory spanning-tree

Dec 19 '17 at 20:14 David Eppstein 49.1k

votes

answers

views

Relaxed minimum dominating set

approximation-algorithms randomized-algorithms integer-programming

Dec 12 at 10:38 AmeerJ 587

vote

answers

views

Sketching order statistics of a stream

data-streams

Feb 14 '19 at 19:46 AmeerJ 587

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

11 Questions

Sorting using a black box

Minimum shortest path cover of $n$ vertices in $R^m$

Fast high-dimensional K-nearest neighbors

Weighted nonoverlapping intervals

Optimal set union tree

Minimum cut on a directed graph with negative term

Maximum weight non-overlapping paths in a DAG

Complexity of maximising weighted sum of and functions on a set of binary variables

Are equally weighted MSTs closely related?

Relaxed minimum dominating set

Sketching order statistics of a stream