|
Search the dblp DataBase
Sung-Pil Hong:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Sung-Pil Hong
A Competitive Online Algorithm for the Paging Problem with "Shelf" Memory. [Citation Graph (0, 0)][DBLP] COCOON, 1999, pp:400-408 [Conf]
- Sung-Jin Chung, Sung-Pil Hong, Hae-Goo Song, Sang-Baeg Kim
Towards Real-Time Optimal Management of Virtual Paths in ATM-Based B-ISDN's. [Citation Graph (0, 0)][DBLP] ICC (1), 1997, pp:225-230 [Conf]
- Byung-Cheon Choi, Sung-Pil Hong
Two-Server Network Disconnection Problem. [Citation Graph (0, 0)][DBLP] ICCSA (3), 2006, pp:785-792 [Conf]
- Sung-Pil Hong, Heesang Lee, Bum Hwan Park
An Efficient Multicast Routing Algorithm for Delay-Sensitive Applications with Dynamic Membership. [Citation Graph (0, 0)][DBLP] INFOCOM, 1998, pp:1433-1440 [Conf]
- Youngkyu Choi, Sunghyun Choi, Sung-Pil Hong
Connection-level QoS provisioning in multiple transmission technology-based OFDM system. [Citation Graph (0, 0)][DBLP] WiOpt, 2006, pp:97-106 [Conf]
- Dorit S. Hochbaum, Sung-Pil Hong
About strongly polynomial time algorithms for quadratic optimization over submodular constraints. [Citation Graph (0, 0)][DBLP] Math. Program., 1995, v:69, n:, pp:269-309 [Journal]
- Sung-Pil Hong, Sushil Verma
A note on the strong polynomiality of convex quadratic programming. [Citation Graph (0, 0)][DBLP] Math. Program., 1995, v:68, n:, pp:131-139 [Journal]
- Sung-Pil Hong, Sung-Jin Chung, Bum Hwan Park
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2004, v:32, n:3, pp:233-239 [Journal]
- Sung-Jin Chung, Sung-Pil Hong, Hae-Goo Song
Towards real-time optimal VP management for ATM nets. [Citation Graph (0, 0)][DBLP] Telecommunication Systems, 2000, v:14, n:1-4, pp:219-242 [Journal]
Optimal search-relocation trade-off in Markovian-target searching. [Citation Graph (, )][DBLP]
A genetic algorithm for joint replenishment based on the exact inventory cost. [Citation Graph (, )][DBLP]
Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|