SCOPUS 정보 검색 플랫폼

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3827 LNCS, Issue , 2005, Pages 71-81

Minimizing a monotone concave function with laminar covering constraints

(3) Sakashita, Mariko a Makino, Kazuhisa b Fujishige, Satoru a

a KYOTO UNIVERSITY (Japan)

b UNIVERSITY OF TOKYO (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; DIFFERENTIATION (CALCULUS); FUNCTION EVALUATION; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

COST FUNCTIONS; LAMINAR COVERING CONSTRAINTS; MONOTONE CONCAVE FUNCTIONS; UNDIRECTED NETWORKS;

SET THEORY;

EID: 33744957958 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/11602613_9 Document Type: Conference Paper

Times cited : (3)

References (10)

1
- 0036462118
- Locating sources to meet flow demands in undirected networks
- K. Arata, S.Iwata, K. Makino, and S. Fujishige: Locating sources to meet flow demands in undirected networks, J. Algorithms, 42 (2002), 54-68.
- (2002) J. Algorithms , vol.42 , pp. 54-68
- Arata, K.¹ Iwata, S.² Makino, K.³ Fujishige, S.⁴

2
- 0013187491
- 2) time
- 2) time, J. Algorithms, 37 (2000), 2-36.
- (2000) J. Algorithms , vol.37 , pp. 2-36
- Benczúr, A.A.¹ Karger, D.R.²

3
- 84987013536
- The minimum augmentation of any graph to k-edge-connected graph
- G.-R.Cai and Y.-G. Sun: The minimum augmentation of any graph to k-edge-connected graph, Networks, 19 (1989), 151-172.
- (1989) Networks , vol.19 , pp. 151-172
- Cai, G.-R.¹ Sun, Y.-G.²

4
- 0000558850
- Augmenting graphs to meet edge-connectivity requirements
- A. Frank: Augmenting graphs to meet edge-connectivity requirements, SIAM J. Discrete Mathematics, 5 (1992), 25-53.
- (1992) SIAM J. Discrete Mathematics , vol.5 , pp. 25-53
- Frank, A.¹

5
- 0003686156
- North-Holland
- L. Lovász: Combinatorial Problems and Exercises, North-Holland (1979).
- (1979) Combinatorial Problems and Exercises
- Lovász, L.¹

6
- 77957098028
- A reduction method for edge-connectivity in graphs
- W. Mader: A reduction method for edge-connectivity in graphs, Ann. Discrete Mathematics, 3(1978), 145-164.
- (1978) Ann. Discrete Mathematics , vol.3 , pp. 145-164
- Mader, W.¹

7
- 13744260309
- Computing extreme sets in graphs and its applications
- January 21-24, Tokyo, Japan
- H. Nagamochi: Computing extreme sets in graphs and its applications, Proc. of the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (January 21-24, 2003, Tokyo, Japan) 349-357.
- (2003) Proc. of the 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications , pp. 349-357
- Nagamochi, H.¹

8
- 0347129777
- Augmenting edge-connectivity over the entire range in Õ(nm) time
- H. Nagamochi and T. Ibaraki: Augmenting edge-connectivity over the entire range in Õ(nm) time, J. Algorithms, 30 (1999), 253-301.
- (1999) J. Algorithms , vol.30 , pp. 253-301
- Nagamochi, H.¹ Ibaraki, T.²

9
- 0001256673
- Some covering problems in location theory on flow networks
- H. Tamura, M. Sengoku, S. Shinoda, and T. Abe: Some covering problems in location theory on flow networks, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E75-A (1992), 678-683.
- (1992) IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences , vol.E75-A , pp. 678-683
- Tamura, H.¹ Sengoku, M.² Shinoda, S.³ Abe, T.⁴

10
- 0023401904
- Edge-connectivity augmentation problems
- T. Watanabe and A. Nakamura: Edge-connectivity augmentation problems, J. Comput. System Sci., 35 (1987), 96-144.
- (1987) J. Comput. System Sci. , vol.35 , pp. 96-144
- Watanabe, T.¹ Nakamura, A.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.