#### Filter Results:

- Full text PDF available (19)

#### Publication Year

2000

2017

- This year (3)
- Last 5 years (10)
- Last 10 years (19)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Dongdong Ge, Xiaoye Jiang, Yinyu Ye
- Math. Program.
- 2011

We discuss the Lp (0 â‰¤ p < 1) minimization problem arising from sparse solution construction and compressed sensing. For any fixed 0 < p < 1, we prove that finding the global minimal value of theâ€¦ (More)

The Multi-Depot Vehicle Routing Problem (MDVRP) is a generalization of the Single-Depot Vehicle Routing Problem (SDVRP) in which vehicle(s) start from multiple depots and return to their depots ofâ€¦ (More)

- Xiaojun Chen, Dongdong Ge, Zizhuo Wang, Yinyu Ye
- Math. Program.
- 2014

We consider the unconstrained Lq-Lp minimization: find a minimizer of âˆ¥Axâˆ’bâˆ¥q+Î»âˆ¥xâˆ¥p for given A âˆˆ RmÃ—n, b âˆˆ R and parameters Î» > 0, p âˆˆ [0, 1) and q â‰¥ 1. This problem has been studied extensively inâ€¦ (More)

- Michael A. Bender, Dongdong Ge, +4 authors Firas Swidan
- SODA
- 2004

We study the problem of sorting integer sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f(l) = lÎ± for all Î± â‰¥ 0, where l is the length ofâ€¦ (More)

- Michael A. Bender, Gerth StÃ¸lting Brodal, +5 authors Alejandro LÃ³pez-Ortiz
- Algorithmica
- 2003

This paper gives tight bounds on the cost of cache-oblivious searching. The paper shows that no cache-oblivious search structure can guarantee a search performance of fewer than lgâ€‰elogâ€‰ B N memoryâ€¦ (More)

- Esther M. Arkin, Michael A. Bender, Dongdong Ge
- SPAA
- 2003

In the Freeze-Tag Problem, the objective is to awaken a set of "asleep" robots, starting with only one "awake" robot. A robot awakens a sleeping robot by moving to the sleeping robot's position. Whenâ€¦ (More)

- Michael A. Bender, Dongdong Ge, +4 authors Firas Swidan
- J. Comput. Syst. Sci.
- 2008

We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f(`) = ` for all Î± â‰¥ 0, where ` is the length of theâ€¦ (More)

This paper presents a general technique to develop approximation algorithms for allocation problems with integral assignment constraints. The core of the method is a randomized dependent roundingâ€¦ (More)

We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by length-weighted reversals inâ€¦ (More)

We consider the unconstrained L2-Lp minimization: find a minimizer of â€–Axâˆ’bâ€–2+Î»â€–xâ€–p for given A âˆˆ R, b âˆˆ R and parameters Î» > 0, p âˆˆ [0, 1). This problem has been studied extensively in variableâ€¦ (More)