Network profile

AmeerJ

Reputation

595

2018
2019
2020
2021

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

12 Questions

Votes Activity Newest Views

votes

answers

views

Sorting using a black box

Mar 26 '13 at 7:18 AmeerJ 595

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 595

-1

votes

answer

213

views

Weighted nonoverlapping intervals

interval-graphs

Jun 20 '17 at 19:47 AmeerJ 595

votes

answers

209

views

Fast high-dimensional K-nearest neighbors

cg.comp-geom time-complexity computational-geometry

Nov 16 '14 at 15:40 Community♦ 1

votes

answers

162

views

Optimal set union tree

optimization tree binary-trees set-system

Oct 14 '18 at 15:57 AmeerJ 595

votes

answers

157

views

Minimum cut on a directed graph with negative term

graph-theory max-flow-min-cut

Dec 10 '17 at 20:48 AmeerJ 595

votes

answers

153

views

Maximum weight non-overlapping paths in a DAG

graph-theory max-flow-min-cut

Dec 10 '17 at 22:00 AmeerJ 595

votes

answer

111

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 595

votes

answers

views

Optimal $\ell^1$ sketching, including the coefficient

randomized-algorithms embeddings

Jan 13 at 12:20 AmeerJ 595

votes

answers

views

Relaxed minimum dominating set

approximation-algorithms randomized-algorithms integer-programming

Dec 12 '19 at 10:38 AmeerJ 595

votes

answer

views

Are equally weighted MSTs closely related?

graph-theory spanning-tree

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

vote

answers

views

Sketching order statistics of a stream

data-streams

Feb 14 '19 at 19:46 AmeerJ 595

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

12 Questions

Sorting using a black box

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

Weighted nonoverlapping intervals

Fast high-dimensional K-nearest neighbors

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

Optimal $\ell^1$ sketching, including the coefficient

Relaxed minimum dominating set

Are equally weighted MSTs closely related?

Sketching order statistics of a stream