Profile Activity

Erel Segal-Halevi

Meta user

Network profile

Reputation

902

2016
2017
2018
2019

Top tag

ds.algorithms

Next privilege

1,000 Rep.

See votes, expandable usercard

Badges

Newest

Benefactor

Next badge

0/1

Impact

4 posts edited

0 helpful flags

97 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

17 Questions

Views Newest Activity Votes

votes

answer

850

views

Maximum disjoint set: what is the actual approximation factor of the greedy algorithm?

cg.comp-geom

Jan 2 '16 at 18:54 Erel Segal-Halevi 902

votes

answer

304

views

Partitioning a rectangle without harming inner rectangles

cg.comp-geom

Nov 19 at 0:15 David Eppstein 45.5k

votes

answers

244

views

The complexity of finding a Borsuk-Ulam point

approximation-algorithms time-complexity topology algebraic-topology

Aug 8 '15 at 11:41 usul 5,409

votes

answers

813

views

Are there problems for which divide-and-conquer / recursion is provably useless?

cc.complexity-theory recursion

Jan 11 '16 at 14:30 Community♦ 1

votes

answers

301

views

A partition problem in which some numbers may be cut

np-hardness reductions partition-problem

Mar 25 at 17:39 Erel Segal-Halevi 902

votes

answer

193

views

Winning strategy in the game of triplets

gt.game-theory combinatorial-game-theory

Nov 12 at 17:48 Erel Segal-Halevi 902

votes

answer

302

views

Largest rectangle not touching any rock in a square field

cg.comp-geom

Jan 2 '16 at 23:52 Community♦ 1

votes

answers

143

views

What can you do with a moving knife besides cutting a cake?

computability turing-machines machine-models

Apr 2 '15 at 11:00 Erel Segal-Halevi 902

votes

answer

views

Solving an LP with at most m-1 nonzeros

np-hardness linear-programming

Jan 27 at 6:29 Erel Segal-Halevi 902

votes

answers

102

views

Reduction from a geometric decision problem to its maximization problem

cg.comp-geom oracles packing

Jan 1 '14 at 19:16 Erel Segal-Halevi 902

votes

answer

141

views

Is set packing easier when the sets are squares?

ds.algorithms packing

Dec 24 '13 at 8:18 Erel Segal-Halevi 902

votes

answers

110

views

Minimum relevant variables in linear system - additive approximation

approximation-algorithms optimization linear-programming approximation-hardness

Jan 9 at 20:24 Sasho Nikolov 16.5k

votes

answers

111

views

A complexity-class of problems that cannot be solved in finite time

cc.complexity-theory reference-request

Apr 29 at 14:15 Erel Segal-Halevi 902

votes

answer

views

Maximum-minimum satisfiability

approximation-algorithms optimization sat

Jan 9 at 20:43 james 36

vote

answers

views

Enumerate all allocations of points in a simplex

ds.algorithms simplex

Mar 9 at 23:17 D.W. 7,591

vote

answers

views

Current review on polygon partition problems

reference-request computational-geometry

Oct 19 '15 at 12:14 Erel Segal-Halevi 902

-4

votes

answer

110

views

How to say “select the largest” when there can be more than one [closed]

ds.algorithms terminology

Oct 31 '13 at 10:14 David Richerby 2,597

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

17 Questions

Maximum disjoint set: what is the actual approximation factor of the greedy algorithm?

Partitioning a rectangle without harming inner rectangles

The complexity of finding a Borsuk-Ulam point

Are there problems for which divide-and-conquer / recursion is provably useless?

A partition problem in which some numbers may be cut

Winning strategy in the game of triplets

Largest rectangle not touching any rock in a square field

What can you do with a moving knife besides cutting a cake?

Solving an LP with at most m-1 nonzeros

Reduction from a geometric decision problem to its maximization problem

Is set packing easier when the sets are squares?

Minimum relevant variables in linear system - additive approximation

A complexity-class of problems that cannot be solved in finite time

Maximum-minimum satisfiability

Enumerate all allocations of points in a simplex

Current review on polygon partition problems

How to say “select the largest” when there can be more than one [closed]