| ²é¿´: 236 | »Ø¸´: 1 | |||
| µ±Ç°Ö÷ÌâÒѾ´æµµ¡£ | |||
alakeseafishÒø³æ (ÕýʽдÊÖ)
|
[½»Á÷]
¡¾ÇóÖú¡¿Ë»á×öÒÔÏÂ2µÀÌ⣿£¨ÈºÖ÷°ïæ°ÑÎÒËùÓнð±ÒË͸ø½â´ðÕߣ©
|
||
|
1. Given a rectangle with some point-holes inside. Design a 2-approximation for minimum length rectangular partition for this rectangle. 2.Let I be a maximal independent set and C a minimum connected dominating set in a unit disk graph. Show that | C | <= 4 | I | + 1. Çë¸ßÊÖ»ØÌû½â´ðÒÔÉÏÁ½µÀÌâ¡£ÎҸм¤²»¾¡¡£ [ Last edited by laizuliang on 2008-6-18 at 19:29 ] |
» ²ÂÄãϲ»¶
085600²ÄÁÏÓ뻯¹¤301·ÖÇóµ÷¼ÁԺУ
ÒѾÓÐ5È˻ظ´
081700£¬311£¬Çóµ÷¼Á
ÒѾÓÐ15È˻ظ´
Ò»Ö¾Ô¸±±¾©»¯¹¤085600 310·ÖÇóµ÷¼Á
ÒѾÓÐ18È˻ظ´
²ÄÁÏÓ뻯¹¤371Çóµ÷¼Á
ÒѾÓÐ14È˻ظ´
336²ÄÁÏÓ뻯¹¤085600Çóµ÷¼Á
ÒѾÓÐ7È˻ظ´
²ÄÁÏ334Çóµ÷¼Á
ÒѾÓÐ18È˻ظ´
331Çóµ÷¼Á
ÒѾÓÐ8È˻ظ´
332Çóµ÷¼Á
ÒѾÓÐ17È˻ظ´
Ò»Ö¾Ô¸ÄϾ©º½¿Õº½Ìì´óѧ ²ÄÁÏÓ뻯¹¤329·ÖÇóµ÷¼Á
ÒѾÓÐ4È˻ظ´
²ÄÁÏר˶322
ÒѾÓÐ7È˻ظ´
liujfeng0712
Òø³æ (СÓÐÃûÆø)
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: 349.5
- Ìû×Ó: 247
- ÔÚÏß: 2.9Сʱ
- ³æºÅ: 524096
- ×¢²á: 2008-03-13
2Â¥2008-06-04 09:38:13














»Ø¸´´ËÂ¥